Sciweavers

388 search results - page 55 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
DKE
2002
218views more  DKE 2002»
13 years 7 months ago
Computing iceberg concept lattices with T
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 suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
PAKDD
2009
ACM
87views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Application-Independent Feature Construction from Noisy Samples
When training classifiers, presence of noise can severely harm their performance. In this paper, we focus on “non-class” attribute noise and we consider how a frequent fault-t...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...
IDEAS
2006
IEEE
98views Database» more  IDEAS 2006»
14 years 1 months ago
PAID: Mining Sequential Patterns by Passed Item Deduction in Large Databases
Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteri...
Zhenglu Yang, Masaru Kitsuregawa, Yitong Wang
WWW
2010
ACM
14 years 2 months 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...
JDCTA
2010
225views more  JDCTA 2010»
13 years 2 months ago
Multi-Level Weighted Sequential Pattern Mining Based on Prime Encoding
Encoding can express the hierarchical relationship in the area of mining the multi-level sequential pattern, up to now all the algorithms of which find frequent sequences just acc...
Yun Li, Lianglei Sun, Jiang Yin, Wenyan Bao, Mengy...