Sciweavers

2065 search results - page 14 / 413
» Techniques of Cluster Algorithms in Data Mining
Sort
View
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
15 years 6 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
82
Voted
ICDM
2008
IEEE
185views Data Mining» more  ICDM 2008»
15 years 3 months ago
Clustering Uncertain Data Using Voronoi Diagrams
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
Ben Kao, Sau Dan Lee, David W. Cheung, Wai-Shing H...
IAT
2006
IEEE
15 years 3 months ago
Crime Pattern Detection Using Data Mining
Data mining can be used to model crime detection problems. Crimes are a social nuisance and cost our society dearly in several ways. Any research that can help in solving crimes f...
Shyam Varan Nath
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 1 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
NIPS
2001
14 years 10 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi