Sciweavers

5603 search results - page 308 / 1121
» Feature Selection for Clustering
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Practical solutions to the problem of diagonal dominance in kernel document clustering
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...
Derek Greene, Padraig Cunningham
APNOMS
2007
Springer
16 years 27 days ago
A Density Based Clustering for Node Management in Wireless Sensor Network
This paper represents a new clustering approach for wireless sensor network. It is a decentralized algorithm having the topology control information in each sensor node. A post lea...
Md. Obaidur Rahman, Byung Goo Choi, Muhammad Mosta...
ICDE
2005
IEEE
132views Database» more  ICDE 2005»
16 years 9 days ago
CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
Mohammed Javeed Zaki, Markus Peters
NIPS
2003
15 years 8 months ago
Geometric Clustering Using the Information Bottleneck Method
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
Susanne Still, William Bialek, Léon Bottou
ICPR
2008
IEEE
16 years 1 months ago
Categorization using semi-supervised clustering
Many applications require matching objects to a predefined, yet highly dynamic set of categories accompanied by category descriptions. We present a novel approach to solving this...
Jianying Hu, Moninder Singh, Aleksandra Mojsilovic