Sciweavers

5096 search results - page 63 / 1020
» Landscape of Clustering Algorithms
Sort
View
ICPP
2000
IEEE
15 years 8 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
ECIR
2009
Springer
16 years 1 months ago
Evaluation of Text Clustering Algorithms with N-Gram-Based Document Fingerprints
This paper presents a new approach designed to reduce the computational load of the existing clustering algorithms by trimming down the documents size using fingerprinting methods...
Javier Parapar, Alvaro Barreiro
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 4 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
JDCTA
2010
119views more  JDCTA 2010»
14 years 11 months ago
Distributed Dual Cluster Algorithm Based on Grid for Sensor Streams
In practical applications, Wireless Sensor Networks generate massive data streams with the dual attributes in geography and optimization domain. Energy source of sensor nodes in W...
Jianghua Huang, Junying Zhang
DATAMINE
2006
89views more  DATAMINE 2006»
15 years 4 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh