Sciweavers

318 search results - page 51 / 64
» Efficient Mining of Generalized Negative Association Rules
Sort
View
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 11 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
14 years 8 months ago
Frequent term-based text clustering
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
Florian Beil, Martin Ester, Xiaowei Xu
ICAIL
2009
ACM
14 years 2 months ago
Integrating induction and deduction for finding evidence of discrimination
Automatic Decision Support Systems (DSS) are widely adopted for screening purposes in socially sensitive tasks, including access to credit, mortgage, insurance, labor market and o...
Dino Pedreschi, Salvatore Ruggieri, Franco Turini
KDD
2005
ACM
146views Data Mining» more  KDD 2005»
14 years 8 months ago
Anonymity-preserving data collection
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in in...
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright