Sciweavers

352 search results - page 70 / 71
» Non-derivable itemset mining
Sort
View
DIS
2003
Springer
14 years 21 days ago
Extraction of Coverings as Monotone DNF Formulas
Abstract. In this paper, we extend monotone monomials as large itemsets in association rule mining to monotone DNF formulas. First, we introduce not only the minimum support but al...
Kouichi Hirata, Ryosuke Nagazumi, Masateru Harao
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 11 months 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...
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 7 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 4 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
SIGSOFT
2005
ACM
14 years 1 months ago
Detecting higher-level similarity patterns in programs
Cloning in software systems is known to create problems during software maintenance. Several techniques have been proposed to detect the same or similar code fragments in software...
Hamid Abdul Basit, Stan Jarzabek