Sciweavers

8776 search results - page 400 / 1756
» Robust Data Clustering
Sort
View
TKDE
2002
127views more  TKDE 2002»
15 years 6 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 7 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
16 years 1 months ago
A Generalization of Proximity Functions for K-Means
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
Junjie Wu, Hui Xiong, Jian Chen, Wenjun Zhou
PKDD
1999
Springer
130views Data Mining» more  PKDD 1999»
15 years 11 months ago
OPTICS-OF: Identifying Local Outliers
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. ...
DEXA
2009
Springer
175views Database» more  DEXA 2009»
16 years 1 months ago
RoK: Roll-Up with the K-Means Clustering Method for Recommending OLAP Queries
Dimension hierarchies represent a substantial part of the data warehouse model. Indeed they allow decision makers to examine data at different levels of detail with On-Line Analyt...
Fadila Bentayeb, Cécile Favre