Sciweavers

134 search results - page 10 / 27
» Identifying non-actionable association rules
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
ICSE
2010
IEEE-ACM
14 years 12 days ago
An eclectic approach for change impact analysis
Change impact analysis aims at identifying software artifacts being affected by a change. In the past, this problem has been addressed by approaches relying on static, dynamic, a...
Michele Ceccarelli, Luigi Cerulo, Gerardo Canfora,...
ICMLA
2004
13 years 9 months ago
Mining interesting contrast rules for a web-based educational system
Web-based educational technologies allow educators to study how students learn (descriptive studies) and which learning strategies are most effective (causal/predictive studies). ...
Behrouz Minaei-Bidgoli, Pang-Ning Tan, William F. ...
EDBT
2009
ACM
85views Database» more  EDBT 2009»
14 years 7 days ago
Expressive, yet tractable XML keys
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In pa...
Sven Hartmann, Sebastian Link
CLA
2007
13 years 9 months ago
ZART: A Multifunctional Itemset Mining Algorithm
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
Laszlo Szathmary, Amedeo Napoli, Sergei O. Kuznets...