Sciweavers

5105 search results - page 668 / 1021
» Approximate Structural Consistency
Sort
View
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 7 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
16 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
16 years 7 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
16 years 1 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
ICCS
2007
Springer
16 years 28 days ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga