388 search results - page 38 / 78 » Mining Frequent Itemsets Using Support Constraints |
ICDM
2003
IEEE
14 years 2 months ago
2003
IEEE
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
ADMA
2008
Springer
14 years 3 months ago
2008
Springer
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
AUSAI
2003
Springer
14 years 2 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
KDID
2004
13 years 10 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. For a book, the title and abstract provide a good first impression of what to expect from it. For a database, getting a first impression is not so straightforward. Whil...