Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

An experimental evaluation of case slicing as a new classification technique

Omar A.A. Shiba, and Md. Nasir Sulaiman, and Fatimah Ahmad, and Ali Mamat, (2003) An experimental evaluation of case slicing as a new classification technique. Journal of ICT, 2 (2). pp. 105-117. ISSN 1675414X

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
217Kb

Official URL: http://www.jict.uum.edu.my/

Affiliations

Universiti Utara Malaysia. Faculty of Computer Science and Irformaiion Technology
Universiti Utara Malaysia. Faculty of Computer Science and Irformaiion Technology
Universiti Utara Malaysia. Faculty of Computer Science and Irformaiion Technology
Universiti Utara Malaysia. Faculty of Computer Science and Irformaiion Technology

Abstract

Several classification techniques are designed to discover such classifications when the classifications are unknown. The techniques are tested and evaluated, however, by matching the classifications they recover against expected classifications. Several such techniques may be compared by experimentally evaluating their performance on the same datasets. The goal of this paper is to evaluate the case slicing technique as a new classification technique based on slicing. The paper achieves this goal in three steps: Firstly, it introduces the case slicing technique as a new approach. Secondly, the paper presents applications of this technique on several datasets. Lastly, it compares the proposed approach with other selected approaches such as K-Nearest Neighbour (K-NN), Base Learning Algorithm (C4.5) and Naïve Bayes classifier (NB) in solving the classification problems. The results obtained show that the proposed approach is a promising method in solving decision-making problem.

Item Type:Journal
Keywords:data mining, case-slicing technique, K-Nearest Neighbour, Base Learning Algorithm, Naive Bayes, classification accuracy.
Subjects:Q Science, Computer Science
ID Code:6671

Aggrawal, c.c., & Philip, S.Y. (1998). Data mining techniques for associations, clustering and classification. In IBM uaure Notes in Computer Science. T. J.Watson Research Center, Yorktown Heights: Springer-Verlag Heidelberg.

Aha, D.W. (1998). Feature weightingftr far; learning algorithms. (Technical Report AIC-98-003). Washington, DC: Naval Research, Laboratory Navy Center for Applied Research in Artificial Intelligence.

Biberman, y. (1994). A context similarity measure. In Proceedings of the European Conference on Machine Learning (ECML-94). (pp. 49-63) Catalina, Italy: Springer Verlag.

Catlett, J. (1991). On changing continuous attributes into ordered discrete attributes. In Proceedings of the European Working Session on Learning, (pp. 164178) Porto, Portugal.

Ching, J.Y., Wong, A.KC & Chan, KCC (1995). Class-dependent discretization for inductive learning from continuous and mixed mode data. IEEE Transactions on Pattern .Analysis and Machine Intelligence, 17(7), 641-651.

Cost, S., & Salzberg, S. (1993). A weighted nearest neighbor algorithm for learning with symbolic features .. Machine Learning, 10,57-78.

Domingos, P. (1995). Rule induction and instance-based learning: A unified approach. In Proceeding of the International Joint Conference on .Artfiaa! Intelligence (IJCA1 -95), (pp. 1226-1232) Montreal.

Dougherty, J., Kohavi, R., & Sahami, M. (1995). Supervised and unsupervised discretization of continuous feature. In Proc. of the 12th International Conference on Machine Learning, (pp. 194-202) Melbourne, Australia.

Edwin, D. (1974). Recent progress in distance and similarity measures in pattern recognition. Second International Joint Conference on Pattern Recognition, (pp. 534-539) Copenhagen, Denmark.

Fayyad, U.M., & Irani, KB. (1992). On the handling of continuous-valued attributes in decision three generation. Machine Learning, 8, 87-102.

Kamkar, M., (1995). An overview and comparative classification of program slicing techniques. Journal of System Software, 31, 197-214.

Ling, X.C, & Zhang, H. (2002). Toward bayesian classifiers with accurate probabilities. In Proceedings of the Sixth Pacific -Asia Conference on KDD, (pp. 123134), Taipei, Taiwan: Springer.

Michalski, R.S., Robert, E.S., & Edwin, D. (1981). A recent advance in data analysis: Clustering objects into classes characterized by conjunctive concepts. In Laveen N. Kanal and Azriel Rosenfeld (Eds.). Progress in pattern recognition, 1,33-56, New York: North-Holland.

Mitchell, T. M. (1997). Machinelearning. NewYork:McGraw-Hill,.

Mohri, T., & Tanaka, H. (1994). An optimal-weighting criterion of case indexing for both numeric and symbolic attributes. In D.W. Aha (Ed.), Casebased reasoning, (Technical Report WS-94-01) (pp. 123-127). Menlo Park, CA: AlII Press.

Murphy, P.M. (1996). UCI reposztones if machine learning and domain theories. Retrieved November 12, 2002, from htt;p:llwww.isc.uci.edul-mlearn/ MLRepository.html

Nadler, M., & Eric, P. S. (1993). Pattern recognition engineering. (pp. 293-294). New York: Wiley.

Pfahringer, B. (1995). Compression-based discretization of continuous attributes. In Proc. if the 12th International Corference on Machine Learning, (pp. 456-463). Melbourne, Australia.

Quinlan, J.R. (1986). Induction of decision trees. Machine Learning, 1(1), 81106.

Quinlan, J.R. (1993). C4.5: Programs for Machine Learning, CA: Morgan Kaufmann Publishers, Inc.

Rachlin, J., Simon, K., Salzberg, S., & David, W.A. (1994). Towards a better understanding of memory-based and Bayesian classifiers. In Proceedings if the Eleventh International Machine Learning Corference, (pp. 242-250). New Brunswick, NJ: Morgan Kaufmann.

Randall, D.W. & Tony, R.M. (1997). Improved heterogeneous distance functions. Journal if Artificial Intelligence Research 6, 1-3.

Salzberg, S. (1991). A nearest hyperrectangle learning method. Machine Learning, 6,277-309

Tip, F. (1995). A survey of program slicing techniques. Journal of Programming Languages, 3, 121-189.

Tversky, A. (1977). Features of similarity. Prychological Review, 84(4), 327-352.

Vasconcelos, W.W. (2000). Slicing knowledge-based systems techniques and applications. Knowledge Based Systems Journal, 13, 177-198.

Weiser, M. (1984). Program slicing. IEEE Transaction Software Engineering, SE -7O (4),352-357.

Wettschereck, D., & Aha, D.W. (1995). Weighting Features. In Proceedings of the 1J1 International Conference on CBR (ICCBR-95). (pp. 347-358). Portugal.

Wilson, D.R., & Martinez, T.R. (1996). Value difference metrics for continuously valued attributes. In Proceedings of the International Conference on Artificial Intelligence, Expert Systems and eura networks, (pp. 11-14).

Xiaoli, Q. (1999). A case-based reasoning rystem for bearing design. (Master's Thesis), Faculty of Computer Science, Drexel University. Philadelphia, PA

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.