CanTree: a canonical-order tree for incremental frequent-pattern mining

CKS Leung, QI Khan, Z Li, T Hoque - Knowledge and Information Systems, 2007 - Springer
Since its introduction, frequent-pattern mining has been the subject of numerous studies,
including incremental updating. Many existing incremental mining algorithms are Apriori …

Efficient mining of frequent patterns from uncertain data

CKS Leung, CL Carmichael… - Seventh IEEE International …, 2007 - ieeexplore.ieee.org
Since its introduction, mining of frequent patterns has been the subject of numerous studies.
Generally, they focus on improving algorithmic efficiency for finding frequent patterns or on …

A new approach to mine frequent patterns using item-transformation methods

F Wu, SW Chiang, JR Lin - Information Systems, 2007 - Elsevier
Mining frequent patterns is a fundamental and crucial task in data-mining problems. The
algorithms reported in the literature for mining frequent patterns can be classified into two …

Web personalisation through incremental individual profiling and support-based user segmentation

PI Hofgesang - IEEE/WIC/ACM International Conference on …, 2007 - ieeexplore.ieee.org
Online personalised" my*" services are gaining popularity due to a growing customer need
for information filtering and customisation. However, current systems mostly rely on some …

Detection and prediction of rare events in transaction databases

C Berberidis, I Vlahavas - International Journal on Artificial …, 2007 - World Scientific
Rare events analysis is an area that includes methods for the detection and prediction of
events, eg a network intrusion or an engine failure, that occur infrequently and have some …

Incremental association mining using a closed-set lattice

A Ceglar, JF Roddick - Journal of Research and Practice in …, 2007 - search.informit.org
The use of closed-set algorithms to generate condensed accurate representations of a
dataset's frequent itemsets has been well documented. This paper presents a novel …

Summarizing evolving data streams using dynamic prefix trees

C Rojas, O Nasraoui - … Conference on Web Intelligence (WI'07), 2007 - ieeexplore.ieee.org
In stream data mining it is important to use the most recent data to cope with the evolving
nature of the underlying patterns. Simply keeping the most recent records offers no flexibility …

Incremental mining and re-mining of frequent patterns without storage of intermediate patterns

FC Tseng - 2007 IEEE International Conference on Industrial …, 2007 - ieeexplore.ieee.org
Data mining has been pervasively used for extracting business intelligence to support
business decisionmaking processes. One of the most fundamental and important tasks of …

Aggregation-based mining methods: from single to N-dimensional data analysis

RCO Alves - 2007 - search.proquest.com
Aplicações nas áreas do comercio electrónico, telecomunicações, varejo, acções, bio
informática, entre outras, possuem, quase que de forma natural, uma organização …

I-Tree: A Frequent Patterns Mining Approach without Candidate Generation or Support Constraint

SK Tanbeer, B Jeong, S Lee - 한국정보처리학회학술대회논문집, 2007 - kiss.kstudy.com
Devising an efficient one-pass frequent pattern mining algorithm has been an issue in data
mining research in recent past. Pattern growth algorithms like FP-Growth which are found …