M-FastMap: A Modified FastMap Algorithm for Visual Cluster Validation in Data Mining
نویسندگان
چکیده
Network Data Mining and Analysis: The <$>{\cal {NEMESIS}}<$> Project p. 1 Privacy Preserving Data Mining: Challenges and Opportunities p. 13 Survey Papers (Invited) A Case for Analytical Customer Relationship Management p. 14 On Data Clustering Analysis: Scalability, Constraints, and Validation p. 28 Association Rules (I) Discovering Numeric Association Rules via Evolutionary Algorithm p. 40 Efficient Rule Retrieval and Postponed Restrict Operations for Association Rule Mining p. 52
منابع مشابه
An Empirical Study on the Visual Cluster Validation Method with Fastmap
This paper presents an empirical study on the visual method for cluster validation based on the Fastmap projection. The visual cluster validation method attempts to tackle two clustering problems in data mining: ( I ) to veri f y partitions of data created by a clustering algorithm and ( 2 ) to identify genuine clusters from data partitions. They are achieved through projecting objects and clus...
متن کاملVisual approach for data mining on medical information databases using Fastmap algorithm
The rapid development of tools for acquisition and storage of information has lead to the formation of enormous medical databases. The large quantity of data definitely surpasses the abilities of humans for efficient usage without specialized tools for analysis. The situation is described as rich in data, but poor in information. In order to fill this growing gap, different approaches from the ...
متن کاملEnsemble Clustering of High Dimensional Data with FastMap Projection
In this paper, we propose an ensemble clustering method for high dimensional data which uses FastMap projection to generate subspace component data sets. In comparison with popular random sampling and random projection, FastMap projection preserves the clustering structure of the original data in the component data sets so that the performance of ensemble clustering is improved significantly. W...
متن کاملFastMap, MetricMap, and Landmark MDS are all Nystrom Algorithms
This paper unifies the mathematical foundation of three multidimensional scaling algorithms: FastMap, MetricMap, and Landmark MDS (LMDS). All three algorithms are based on the Nyström approximation of the eigenvectors and eigenvalues of a matrix. LMDS is applies the basic Nyström approximation, while FastMap and MetricMap use generalizations of Nyström, including deflation and using more points...
متن کاملTowards Efficient Music Genre Classification Using Fastmap
Automatic genre classification aims to correctly categorize an unknown recording with a music genre. Recent studies use the Kullback-Leibler (KL) divergence to estimate music similarity then perform classification using k-nearest neighbours (k-NN). However, this approach is not practical for large databases. We propose an efficient genre classifier that addresses the scalability problem. It use...
متن کامل