Sciweavers

2065 search results - page 167 / 413
» Techniques of Cluster Algorithms in Data Mining
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 9 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
DEXA
2007
Springer
154views Database» more  DEXA 2007»
16 years 19 days ago
Performance Oriented Schema Matching
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
Khalid Saleem, Zohra Bellahsene, Ela Hunt
SADM
2008
165views more  SADM 2008»
15 years 6 months ago
Global Correlation Clustering Based on the Hough Transform
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
Elke Achtert, Christian Böhm, Jörn David...
APWEB
2009
Springer
15 years 4 months ago
Core-Tag Clustering for Web 2.0 Based on Multi-similarity Measurements
Along with the development of Web2.0, folksonomy has become a hot topic related to data mining, information retrieval and social network. The tag semantic is the key for deep under...
Yexi Jiang, Changjie Tang, Kaikuo Xu, Lei Duan, Li...
ICMLA
2008
15 years 8 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad