Sciweavers

25041 search results - page 145 / 5009
» Algorithms for Clustering Data
Sort
View
ICCV
2007
IEEE
14 years 2 months ago
Latent Model Clustering and Applications to Visual Recognition
We consider clustering situations in which the pairwise affinity between data points depends on a latent ”context” variable. For example, when clustering features arising fro...
Simon Polak, Amnon Shashua
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
14 years 8 months ago
Exploring the community structure of newsgroups
d Abstract] Christian Borgs Jennifer Chayes Mohammad Mahdian Amin Saberi We propose to use the community structure of Usenet for organizing and retrieving the information stored i...
Christian Borgs, Jennifer T. Chayes, Mohammad Mahd...
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
13 years 9 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
13 years 11 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
ICTAI
2005
IEEE
14 years 1 months ago
Cellular Ants: Combining Ant-Based Clustering with Cellular Automata
This paper proposes a novel data clustering algorithm, coined ‘cellular ants’, which combines principles of cellular automata and ant colony optimization algorithms to group s...
Andrew Vande Moere, Justin James Clayden