Sciweavers

432 search results - page 63 / 87
» Set-Oriented Mining for Association Rules in Relational Data...
Sort
View
ICCS
2004
Springer
15 years 5 months ago
Iceberg Query Lattices for Datalog
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
Gerd Stumme
ICSE
2004
IEEE-ACM
15 years 12 months ago
Mining Version Histories to Guide Software Changes
We apply data mining to version histories in order to guide programmers along related changes: "Programmers who changed these functions also changed...." Given a set of e...
Andreas Zeller, Peter Weißgerber, Stephan Di...
CIKM
2001
Springer
15 years 3 months ago
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...
Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 3 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
DATESO
2010
148views Database» more  DATESO 2010»
14 years 9 months ago
Using Spectral Clustering for Finding Students' Patterns of Behavior in Social Networks
Abstract. The high dimensionality of the data generated by social networks has been a big challenge for researchers. In order to solve the problems associated with this phenomenon,...
Gamila Obadi, Pavla Drázdilová, Jan ...