Sciweavers

903 search results - page 10 / 181
» Using Library Dependencies for Clustering
Sort
View
PKDD
2004
Springer
138views Data Mining» more  PKDD 2004»
14 years 1 months ago
Combining Multiple Clustering Systems
Three methods for combining multiple clustering systems are presented and evaluated, focusing on the problem of finding the correspondence between clusters of different systems. ...
Constantinos Boulis, Mari Ostendorf
ICFP
2010
ACM
13 years 8 months ago
Total parser combinators
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
Nils Anders Danielsson
IJCAI
2007
13 years 9 months ago
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
Shehroz S. Khan, Shri Kant
PDPTA
2000
13 years 9 months ago
Dependable High Performance Computing on a Parallel Sysplex Cluster
In this paper we address the issue of dependable distributed high performance computing in the field of Symbolic Computation. We describe the extension of a middleware infrastructu...
Wolfgang Blochinger, Reinhard Bündgen, Andrea...
FLAIRS
2004
13 years 9 months ago
Adaptive K-Means Clustering
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering ...
Sanjiv K. Bhatia