583 search results - page 43 / 117 » Mining evolving data streams for frequent patterns |
COMPUTE
2010
ACM
15 years 2 months ago
2010
ACM
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
PAKDD
2004
ACM
15 years 3 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
FIMI
2003
14 years 11 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...