732 search results - page 80 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
IWCIA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
ADVIS
2004
Springer
14 years 1 months ago
2004
Springer
Data mining is an interactive and iterative process. Users issue series of similar queries until they receive satisfying results, yet currently available data mining systems do not...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
KDD
1997
ACM
13 years 11 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...