Sciweavers

873 search results - page 23 / 175
» Reducing the Frequent Pattern Set
Sort
View
FIMI
2004
279views Data Mining» more  FIMI 2004»
13 years 9 months ago
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
GEOINFORMATICA
2006
102views more  GEOINFORMATICA 2006»
13 years 8 months ago
Mining Co-Location Patterns with Rare Events from Spatial Data Sets
Abstract A co-location pattern is a group of spatial features/events that are frequently co-located in the same region. For example, human cases of West Nile Virus often occur in r...
Yan Huang, Jian Pei, Hui Xiong
ISCI
2008
116views more  ISCI 2008»
13 years 8 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
KDD
1998
ACM
105views Data Mining» more  KDD 1998»
14 years 3 days ago
PlanMine: Sequence Mining for Plan Failures
This paper presents the PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because ...
Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara
AIR
2000
91views more  AIR 2000»
13 years 7 months ago
PlanMine: Predicting Plan Failures Using Sequence Mining
This paper presents the PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because p...
Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara