147 search results - page 11 / 30 » Constraint-Based Rule Mining in Large, Dense Databases |
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
IDEAL
2003
Springer
15 years 3 months ago
2003
Springer
In recent years interest has grown in “mining” large databases to extract novel and interesting information. Knowledge Discovery in Databases (KDD) has been recognised as an em...
ICDM
2003
IEEE
15 years 3 months ago
2003
IEEE
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
ENGL
2007
14 years 10 months ago
2007
— This paper presents clustering techniques (K-means, Fuzzy K-means, Subtractive) applied on specific databases (Flower Classification and Mackey-Glass time series) , to automati...
148
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...