Sciweavers

99 search results - page 17 / 20
» Single-Pass List Partitioning
Sort
View
110
Voted
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
16 years 2 days ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
16 years 2 days ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 2 days ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
92
Voted
PEPM
2010
ACM
15 years 8 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
ECCB
2008
IEEE
15 years 6 months ago
Connect the dots: exposing hidden protein family connections from the entire sequence tree
Motivation: Mapping of remote evolutionary links is a classic computational problem of much interest. Relating protein families allows for functional and structural inference on u...
Yaniv Loewenstein, Michal Linial