Sciweavers

147 search results - page 27 / 30
» Constraint-Based Rule Mining in Large, Dense Databases
Sort
View
RCIS
2010
14 years 8 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
15 years 11 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
15 years 10 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
TODS
2002
76views more  TODS 2002»
14 years 9 months ago
Searching for dependencies at multiple abstraction levels
g for Dependencies at Multiple Abstraction Levels Toon Calders Raymond T. Ng Jef Wijsen The notion of roll-up dependency (RUD) extends functional dependencies with generalization ...
Toon Calders, Raymond T. Ng, Jef Wijsen
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
15 years 11 months ago
Discovering Conditional Functional Dependencies
This paper investigates the discovery of conditional functional dependencies (CFDs). CFDs are a recent extension of functional dependencies (FDs) by supporting patterns of semantic...
Wenfei Fan, Floris Geerts, Laks V. S. Lakshmanan, ...