Sciweavers

754 search results - page 10 / 151
» Robust information-theoretic clustering
Sort
View
ATAL
2003
Springer
15 years 2 months ago
Strategies for the Increased Robustness of Ant-Based Clustering
This paper introduces a set of algorithmic modifications that improve the partitioning results obtained with ant-based clustering. Moreover, general parameter settings and a self-...
Julia Handl, Joshua D. Knowles, Marco Dorigo
NCI
2004
142views Neural Networks» more  NCI 2004»
14 years 11 months ago
A competitive and cooperative learning approach to robust data clustering
This paper presents a new semi-competitive learning paradigm named Competitive and Cooperative Learning (CCL), in which seed points not only compete each other for updating to ada...
Yiu-ming Cheung
ICCV
2007
IEEE
15 years 11 months ago
Noise Robust Spectral Clustering
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
Zhenguo Li, Jianzhuang Liu, Shifeng Chen, Xiaoou T...
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
15 years 11 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
INFOCOM
2005
IEEE
15 years 3 months ago
Routing in ad hoc networks: a theoretical framework with practical implications
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...
Nianjun Zhou, Alhussein A. Abouzeid