Results 251 to 260 of about 23,652 (302)

Approximate mining of frequent patterns on streams [PDF]

open access: possibleIntelligent Data Analysis, 2007
Many critical applications, like intrusion detection or stock market analysis, require a nearly immediate result based on a continuous and infinite stream of data. In most cases finding an exact solution is not compatible with limited availability of resources and real time constraints, but an approximation of the exact result is enough for most ...
SILVESTRI, Claudio, ORLANDO, Salvatore
openaire   +5 more sources

Mining frequent trajectory pattern based on vague space partition

open access: yesKnowledge-Based Systems, 2013
Frequent trajectory pattern mining is an important spatiotemporal data mining problem with broad applications. However, it is also a difficult problem due to the approximate nature of spatial trajectory locations.
Kunyuan Hu, Tao Ku, Xiaohui Yan
exaly   +1 more source

Mining frequent patterns with the pattern tree

New Generation Computing, 2005
Mining frequent patterns with a frequent pattern tree (FP-tree in short) avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves much better performance and efficiency than Apriori-like algorithms. However, the database still needs to be scanned twice to get the FP-tree.
Hao Huang   +2 more
openaire   +1 more source

On Closed Constrained Frequent Pattern Mining

Fourth IEEE International Conference on Data Mining (ICDM'04), 2005
Constrained frequent patterns and closed frequent patterns are two paradigms aimed at reducing the set of extracted patterns to a smaller, more interesting, subset. Although a lot of work has been done with both these paradigms, there is still confusion around the mining problem obtained by joining closed and constrained frequent patterns in a unique ...
Bonchi F, Lucchese C
openaire   +3 more sources

Mining Supplemental Frequent Patterns

2008
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 transaction database. With given minimum support (min_sup) and minimum share support (min_share_sup), each SFP includes a core frequent pattern (BFP) used to draw other frequent or ...
Yintian Liu   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy