Sciweavers

1301 search results - page 42 / 261
» Default Clustering from Sparse Data Sets
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Subspace outlier mining in large multimedia databases
Abstract. Increasingly large multimedia databases in life sciences, ecommerce, or monitoring applications cannot be browsed manually, but require automatic knowledge discovery in d...
Ira Assent, Ralph Krieger, Emmanuel Müller, T...
BMCBI
2007
149views more  BMCBI 2007»
13 years 8 months ago
Novel and simple transformation algorithm for combining microarray data sets
Background: With microarray technology, variability in experimental environments such as RNA sources, microarray production, or the use of different platforms, can cause bias. Suc...
Ki-Yeol Kim, Dong Hyuk Ki, Ha Jin Jeong, Hei-Cheul...
VLDB
1999
ACM
224views Database» more  VLDB 1999»
14 years 29 days ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
ACL
1993
13 years 10 months ago
Distributional Clustering of English Words
We describe and evaluate experimentally a method for clustering words according to their distribution in particular syntactic contexts. Words are represented by the relative frequ...
Fernando C. N. Pereira, Naftali Tishby, Lillian Le...
BIOCOMP
2006
13 years 10 months ago
A Heuristic Approach to Scoring Gene Clustering Algorithms
In the past decades, many clustering algorithms have been proposed for the analysis of gene expression data, but little guidance is available to help choose among them. Given the ...
Longde Yin, Chun-Hsi Huang