Sciweavers

2463 search results - page 66 / 493
» Compressing Pattern Databases
Sort
View
CIKM
2009
Springer
14 years 5 months ago
Graph classification based on pattern co-occurrence
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
Ning Jin, Calvin Young, Wei Wang
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 10 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...
ISCI
2007
123views more  ISCI 2007»
13 years 10 months ago
Mining spatial association rules in image databases
In this paper, we propose a novel spatial mining algorithm, called 9DLT-Miner, to mine the spatial association rules from an image database, where every image is represented by th...
Anthony J. T. Lee, Ruey-Wen Hong, Wei-Min Ko, Wen-...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 11 months ago
Characteristic relational patterns
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
Arne Koopman, Arno Siebes
ER
2009
Springer
112views Database» more  ER 2009»
14 years 5 months ago
A Generic Set Theory-Based Pattern Matching Approach for the Analysis of Conceptual Models
Jörg Becker, Patrick Delfmann, Sebastian Herw...