Sciweavers

45 search results - page 8 / 9
» Discovering Frequent Itemsets in the Presence of Highly Freq...
Sort
View
WWW
2010
ACM
14 years 7 days ago
On the high density of leadership nuclei in endorsement social networks
In this paper we study the community structure of endorsement networks, i.e., social networks in which a directed edge u → v is asserting an action of support from user u to use...
Guillermo Garrido, Francesco Bonchi, Aristides Gio...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 5 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
SPAA
1997
ACM
13 years 9 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
PAKDD
2010
ACM
152views Data Mining» more  PAKDD 2010»
13 years 10 months ago
Mining Association Rules in Long Sequences
Abstract. Discovering interesting patterns in long sequences, and finding confident association rules within them, is a popular area in data mining. Most existing methods define...
Boris Cule, Bart Goethals
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 9 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...