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...
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...
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...
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...
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...