1300 search results - page 44 / 260 » Association Schemoids and Their Categories |
106
click to vote
KDD
2006
ACM
16 years 27 days ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
107
Voted
KDD
2005
ACM
16 years 27 days ago
2005
ACM
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...
116
click to vote
KDD
2003
ACM
16 years 27 days ago
2003
ACM
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
102
Voted
CHI
2008
ACM
16 years 27 days ago
2008
ACM
Web search is often viewed as a solitary task; however, there are many situations in which groups of people gather around a single computer to jointly search for information onlin...
189
Voted
POPL
2008
ACM
16 years 24 days ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...