Sciweavers

22 search results - page 3 / 5
» Quantization and clustering with Bregman divergences
Sort
View
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
14 years 5 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
SDM
2008
SIAM
120views Data Mining» more  SDM 2008»
13 years 6 months ago
Spatial Scan Statistics for Graph Clustering
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
Bei Wang, Jeff M. Phillips, Robert Schreiber, Denn...
IDA
2010
Springer
13 years 3 months ago
Clustering with feature order preferences
We propose a clustering algorithm that effectively utilizes feature order preferences, which have the form that feature s is more important than feature t. Our clustering formulati...
Jun Sun, Wenbo Zhao, Jiangwei Xue, Zhiyong Shen, Y...
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
13 years 6 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 6 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...