Using of Two Analyzing Methods Multidimensional Scaling and Hierarchical Cluster for Pattern Recognition via Data Mining

Ibrahim, Ali A.; ALnaima, Fwzi M.; Jasim, Ammar D.
January 2013
International Journal of Computer Science Engineering & Technolo;Jan2013, Vol. 3 Issue 1, p16
Academic Journal
The present study aims at making comparison between two analyzing methods , multidimensional scaling and hierarchical clustering methods ,on the other hand, to imply data mining by using of these two analyzing methods to classify and discriminate twenty five samples of technician pieces (Prehistoric goblets) through the study of Engineering shapes and special figures for every sample separately (case by case) , which backs to the periods before B.C. and discovered in Malaysia .The results of two methods concord and resemble each other equally in their classifications of Data. A multidimensional Scaling method seems to be more precise and give more details in comparison with hierarchical cluster methods.


Related Articles

  • An Efficient Algorithm for Mining Maximal Frequent Item Sets. Rahman, A. M. J. Md. Zubair; Balasubramanie, P. // Journal of Computer Science;2008, Vol. 4 Issue 8, p638 

    Problem Statement: In today's life, the mining of frequent patterns is a basic problem in data mining applications. The algorithms which are used to generate these frequent patterns must perform efficiently. The objective was to propose an effective algorithm which generates frequent patterns in...

  • AUTONOMOUS EMOTION RECOGNITION SYSTEM: APPROACHES FOR DATA MINING. Drungilas, Darius; Bielskis, Antanas Andrius // Management (16487974);2009, Vol. 15 Issue 2, p179 

    The detection of emotion is becoming an increasingly important field for human-computer interaction as the advantages emotion recognition offer become more apparent and realisable. However there are still many issues (data filtering, parameter's extraction, data preprocessing, interpreting,...

  • Multidimensional scaling as a tool for analysing quality of life data. Kemmler, G.; Holzner, B.; Kopp, M.; Dünser, M.; Greil, R.; Hahn, E.; Sperner-Unterweger, B.; Dünser, M // Quality of Life Research;May2002, Vol. 11 Issue 3, p223 

    Multidimensional scaling (MDS) is introduced and discussed as a graphical method to complement conventional descriptive and confirmatory methods in the validation and analysis of quality of life (QOL) data. An outline of M DS as a statistical technique is given, and its application in the...

  • Visualization Methodology for Multidimensional Scaling. Buja, Andreas; Swayne, Deborah F. // Journal of Classification;2002, Vol. 19 Issue 1, p7 

    Discusses the application of interactive visualization techniques to multidimensional scaling. Analysis of the Rothkopf Morse code data; Visual checks of convergence of optimization; Power transformations for the analysis of indifferentiation.

  • Combining bagging, boosting, rotation forest and random subspace methods. Kotsiantis, Sotiris // Artificial Intelligence Review;Mar2011, Vol. 35 Issue 3, p223 

    Bagging, boosting, rotation forest and random subspace methods are well known re-sampling ensemble methods that generate and combine a diversity of learners using the same learning algorithm for the base-classifiers. Boosting and rotation forest algorithms are considered stronger than bagging...

  • CONDITIONAL DYNAMIC MUTUAL INFORMATION-BASED FEATURE SELECTION. Huawen Liu; Yuchang Mo; Jianmin ZHAO // Computing & Informatics;2012, Vol. 31 Issue 6, p1193 

    With emergence of new techniques, data in many fields are getting larger and larger, especially in dimensionality aspect. The high dimensionality of data may pose great challenges to traditional learning algorithms. In fact, many of features in large volume of data are redundant and noisy. Their...

  • Combining clustering solutions with varying number of clusters. Aggarwal, Geeta; Garg, Saurabh; Gupta, Neelima // International Journal of Computer Science Issues (IJCSI);Mar2014, Vol. 11 Issue 2, p240 

    Cluster ensemble algorithms have been used in different field like data mining, bioinformatics and pattern recognition. Many of them use label correspondence as a step which can be performed with some accuracy if all the input partitions are generated with same k. Thus these algorithms produce...

  • Evolving Optimization to Improve Diorama's Representation using a Mosaic Image. Suarent, Simonné; Ochoa, Alberto; Jöns, S.; Montes, Fernando; Spianetta, Alessandra // Journal of Computers;Aug2009, Vol. 4 Issue 8, p734 

    Evolving Optimization is a generic term used to make reference to the solution of planned and implemented computational problems with base in models of an evolutionary process. Most of the bioinspired algorithms, propose biological paradigms, and the concepts of natural selection, mutation,...

  • Efficient Discovery of Frequent Patterns using KFP-Tree from Web Logs. Meena, Shyam Sundar // International Journal of Computer Applications;7/1/2012, Vol. 50, p15 

    Frequent pattern discovery is a heavily focused area in data mining. Discovering concealed information from Web log data is called Web usage mining. Web usage mining discovers interesting and frequent user access patterns from web logs. This paper contains a novel approach, based on k-mean and...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics