Sciweavers

927 search results - page 51 / 186
» Stability of k -Means Clustering
Sort
View
DAC
1989
ACM
14 years 4 days ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
CIKM
2006
Springer
13 years 10 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
IPMI
2007
Springer
14 years 9 months ago
Probabilistic Clustering and Quantitative Analysis of White Matter Fiber Tracts
A novel framework for joint clustering and point-by-point mapping of white matter fiber pathways is presented. Accurate clustering of the trajectories into fiber bundles requires p...
Mahnaz Maddah, William M. Wells III, Simon K. Warf...
CEC
2009
IEEE
14 years 24 days ago
Automatic clustering with multi-objective Differential Evolution algorithms
—This paper applies the Differential Evolution (DE) algorithm to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It compares the performa...
Kaushik Suresh, Debarati Kundu, Sayan Ghosh, Swaga...
CORR
2010
Springer
183views Education» more  CORR 2010»
13 years 8 months ago
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
Alok Ojha, Hongmei Deng, Dharma P. Agrawal, Sugata...