Sciweavers

336 search results - page 38 / 68
» Data Mining Using Fractals and Power Laws
Sort
View
IDA
2000
Springer
14 years 11 months ago
Reducing redundancy in characteristic rule discovery by using integer programming techniques
The discovery of characteristic rules is a well-known data mining task and has lead to several successful applications. However, because of the descriptive nature of characteristic...
Tom Brijs, Koen Vanhoof, Geert Wets
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
PKDD
2009
Springer
95views Data Mining» more  PKDD 2009»
15 years 6 months ago
Non-redundant Subgroup Discovery Using a Closure System
Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function. As standard quality functio...
Mario Boley, Henrik Grosskreutz
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
16 years 7 days ago
Web site mining: a new way to spot competitors, customers and suppliers in the world wide web
When automatically extracting information from the world wide web, most established methods focus on spotting single HTMLdocuments. However, the problem of spotting complete web s...
Martin Ester, Hans-Peter Kriegel, Matthias Schuber...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 1 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...