Sciweavers

969 search results - page 96 / 194
» Expectation-MiniMax Approach to Clustering Analysis
Sort
View
IPPS
2008
IEEE
15 years 10 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
MLDM
2005
Springer
15 years 9 months ago
Clustering Large Dynamic Datasets Using Exemplar Points
In this paper we present a method to cluster large datasets that change over time using incremental learning techniques. The approach is based on the dynamic representation of clus...
William Sia, Mihai M. Lazarescu
FSTTCS
2001
Springer
15 years 8 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
SPIESR
2004
118views Database» more  SPIESR 2004»
15 years 5 months ago
New method for visual descriptor evaluation
Evaluation in visual information retrieval is usually performed by executing test queries and calculating recall and precision based on predefined media collections and ground tru...
Horst Eidenberger
BMCBI
2006
181views more  BMCBI 2006»
15 years 4 months ago
Array2BIO: from microarray expression data to functional annotation of co-regulated genes
Background: There are several isolated tools for partial analysis of microarray expression data. To provide an integrative, easy-to-use and automated toolkit for the analysis of A...
Gabriela G. Loots, Patrick S. G. Chain, Shalini Ma...