Sciweavers

3133 search results - page 124 / 627
» Representing clusters for retrieval
Sort
View
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
15 years 8 months ago
Kernel based automatic clustering using modified particle swarm optimization algorithm
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
Ajith Abraham, Swagatam Das, Amit Konar
SAC
2006
ACM
15 years 7 months ago
A scalable algorithm for high-quality clustering of web snippets
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
Filippo Geraci, Marco Pellegrini, Paolo Pisati, Fa...
IJIS
2008
123views more  IJIS 2008»
15 years 1 months ago
Algorithms of nonlinear document clustering based on fuzzy multiset model
Abstract: Fuzzy multiset is applicable as a model of information retrieval because it has the mathematical structure which expresses the number and the degree of attribution of an ...
Kiyotaka Mizutani, Ryo Inokuchi, Sadaaki Miyamoto
PR
2007
107views more  PR 2007»
15 years 1 months ago
Newtonian clustering: An approach based on molecular dynamics and global optimization
Given a data set, a dynamical procedure is applied to the data points in order to shrink and separate, possibly overlapping clusters. Namely, Newton’s equations of motion are em...
Konstantinos Blekas, Isaac E. Lagaris
107
Voted
ICML
2006
IEEE
16 years 2 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani