Sciweavers

616 search results - page 49 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
TKDE
2008
175views more  TKDE 2008»
13 years 7 months ago
Efficient Phrase-Based Document Similarity for Clustering
Phrase has been considered as a more informative feature term for improving the effectiveness of document clustering. In this paper, we propose a phrase-based document similarity t...
Hung Chim, Xiaotie Deng
IWOCA
2010
Springer
240views Algorithms» more  IWOCA 2010»
13 years 2 months ago
Path-Based Supports for Hypergraphs
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, A...
EOR
2007
110views more  EOR 2007»
13 years 7 months ago
A hierarchical ant based clustering algorithm and its use in three real-world applications
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...
Hanene Azzag, Gilles Venturini, Antoine Oliver, Ch...
IWANN
2009
Springer
14 years 2 months ago
Self Organized Dynamic Tree Neural Network
Cluster analysis is a technique used in a variety of fields. There are currently various algorithms used for grouping elements that are based on different methods including partiti...
Juan Francisco de Paz, Sara Rodríguez, Javi...
ICDM
2003
IEEE
71views Data Mining» more  ICDM 2003»
14 years 1 months ago
Tree-structured Partitioning Based on Splitting Histograms of Distances
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
Longin Jan Latecki, Rajagopal Venugopal, Marc Sobe...