Sciweavers

318 search results - page 36 / 64
» Efficient Mining of Generalized Negative Association Rules
Sort
View
DAWAK
2010
Springer
13 years 8 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
CIKM
2006
Springer
13 years 11 months ago
Multi-evidence, multi-criteria, lazy associative document classification
We present a novel approach for classifying documents that combines different pieces of evidence (e.g., textual features of documents, links, and citations) transparently, through...
Adriano Veloso, Wagner Meira Jr., Marco Cristo, Ma...
EDBT
2000
ACM
13 years 11 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...
SAC
2010
ACM
14 years 2 months ago
Mining temporal relationships among categories
Temporal text mining deals with discovering temporal patterns in text over a period of time. A Theme Evolution Graph (TEG) is used to visualize when new themes are created and how...
Saket S. R. Mengle, Nazli Goharian