22 search results - page 3 / 5 » Mining Implications from Lattices of Closed Trees |
IFSA
2003
Springer
13 years 11 months ago
2003
Springer
In this paper we use concepts from the lattice-based theory of morphological operators and fuzzy sets to develop generalized lattice image operators that are nonlinear convolutions...
SIGMOD
1997
ACM
13 years 10 months ago
1997
ACM
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confi...
RSCTC
2000
Springer
13 years 10 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 ...
KDD
2005
ACM
14 years 6 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
KDD
2009
ACM
14 years 1 months ago
2009
ACM
The pervasiveness of mobile devices and location based services is leading to an increasing volume of mobility data. This side effect provides the opportunity for innovative meth...