Sciweavers

152 search results - page 6 / 31
» Finding Consistent Clusters in Data Partitions
Sort
View
DBA
2004
113views Database» more  DBA 2004»
15 years 1 months ago
A Quality Measure for Distributed Clustering
Clustering has become an increasingly important task in modern application domains. Mostly, the data are originally collected at different sites. In order to extract information f...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
JDWM
2006
178views more  JDWM 2006»
14 years 11 months ago
Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining ta...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
JMMA
2010
162views more  JMMA 2010»
14 years 6 months ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
16 years 1 days ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
PAMI
2008
152views more  PAMI 2008»
14 years 11 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet