Sciweavers

1971 search results - page 85 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
14 years 1 months ago
Online Hierarchical Clustering in a Data Warehouse Environment
Many important industrial applications rely on data mining methods to uncover patterns and trends in large data warehouse environments. Since a data warehouse is typically updated...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 8 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 8 months 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...
IJCM
2007
205views more  IJCM 2007»
13 years 7 months ago
BTF modelling using BRDF texels
The highest fidelity representations of realistic real-world materials currently used comprise Bidirectional Texture Functions (BTF). The BTF is a six dimensional function dependi...
Jirí Filip, Michal Haindl
CIKM
2009
Springer
14 years 2 months ago
Fragment-based clustering ensembles
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...
Ou Wu, Mingliang Zhu, Weiming Hu