Sciweavers

252 search results - page 33 / 51
» Mining Frequent Patterns without Candidate Generation
Sort
View
FIMI
2003
88views Data Mining» more  FIMI 2003»
13 years 9 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon
ICDM
2008
IEEE
164views Data Mining» more  ICDM 2008»
14 years 2 months ago
Classifying High-Dimensional Text and Web Data Using Very Short Patterns
In this paper, we propose the "Democratic Classifier", a simple, democracy-inspired patternbased classification algorithm that uses very short patterns for classificatio...
Hassan H. Malik, John R. Kender
ECAI
2010
Springer
13 years 6 months ago
From bursty patterns to bursty facts: The effectiveness of temporal text mining for news
Many document collections are by nature dynamic, evolving as the topics or events they describe change. The goal of temporal text mining is to discover bursty patterns and to ident...
Ilija Subasic, Bettina Berendt
WAIM
2004
Springer
14 years 1 months ago
Mining Web Sequential Patterns Incrementally with Revised PLWAP Tree
Since point and click at web pages generate continuous data stream, which flow into web log data, old patterns may be stale and need to be updated. Algorithms for mining web seque...
Christie I. Ezeife, Min Chen
AIME
2009
Springer
13 years 5 months ago
Mining Safety Signals in Spontaneous Reports Database Using Concept Analysis
Abstract. In pharmacovigilance, linking the adverse reactions by patients to drugs they took is a key activity typically based on the analysis of patient reports. Yet generating po...
Mohamed Rouane Hacene, Yannick Toussaint, Petko Va...