Sciweavers

74 search results - page 12 / 15
» The complexity of mining maximal frequent itemsets and maxim...
Sort
View
TKDE
1998
111views more  TKDE 1998»
13 years 7 months ago
Efficient Data Mining for Path Traversal Patterns
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...
Ming-Syan Chen, Jong Soo Park, Philip S. Yu
KAIS
2010
139views more  KAIS 2010»
13 years 6 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 8 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
GEOINFORMATICA
2006
102views more  GEOINFORMATICA 2006»
13 years 7 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
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
14 years 1 days ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...