Interestingness measures for data mining: A survey

L Geng, HJ Hamilton - ACM Computing Surveys (CSUR), 2006 - dl.acm.org
Interestingness measures play an important role in data mining, regardless of the kind of
patterns being mined. These measures are intended for selecting and ranking patterns …

Frequent item set mining

C Borgelt - Wiley interdisciplinary reviews: data mining and …, 2012 - Wiley Online Library
Frequent item set mining is one of the best known and most popular data mining methods.
Originally developed for market basket analysis, it is used nowadays for almost any task that …

Search for neutral heavy leptons produced in Z decays

DELPHI collaboration - Zeitschrift für Physik C Particles and Fields, 1997 - Springer
Abstract Weak isosinglet Neutral Heavy Leptons (vm) have been searched for using data
collected by the DELPHI detector corresponding to 3.3× 10 6 hadronic Z 0 decays at LEP1 …

Subgroup discovery

M Atzmueller - Wiley Interdisciplinary Reviews: Data Mining and …, 2015 - Wiley Online Library
Subgroup discovery is a broadly applicable descriptive data mining technique for identifying
interesting subgroups according to some property of interest. This article summarizes …

Computing iceberg concept lattices with titanic

G Stumme, R Taouil, Y Bastide, N Pasquier… - Data & knowledge …, 2002 - Elsevier
We introduce the notion of iceberg concept lattices and show their use in knowledge
discovery in databases. Iceberg lattices are a conceptual clustering method, which is well …

An integrated data mining and behavioral scoring model for analyzing bank customers

NC Hsieh - Expert systems with applications, 2004 - Elsevier
Analyzing bank databases for customer behavior management is difficult since bank
databases are multi-dimensional, comprised of monthly account records and daily …

Mining non-redundant association rules

MJ Zaki - Data mining and knowledge discovery, 2004 - Springer
The traditional association rule mining framework produces many redundant rules. The
extent of redundancy is a lot larger than previously suspected. We present a new framework …

Association mining

A Ceglar, JF Roddick - ACM Computing Surveys (CSUR), 2006 - dl.acm.org
The task of finding correlations between items in a dataset, association mining, has received
considerable attention over the last decade. This article presents a survey of association …

A comparative study of multigranulation rough sets and concept lattices via rule acquisition

J Li, Y Ren, C Mei, Y Qian, X Yang - Knowledge-Based Systems, 2016 - Elsevier
Recently, by combining rough set theory with granular computing, pessimistic and optimistic
multigranulation rough sets have been proposed to derive “AND” and “OR” decision rules …

Mining frequent patterns with counting inference

Y Bastide, R Taouil, N Pasquier, G Stumme… - ACM SIGKDD …, 2000 - dl.acm.org
In this paper, we propose the algorithm PASCAL which introduces a novel optimization of
the well-known algorithm Apriori. This optimization is based on a new strategy called pattern …