Sciweavers

318 search results - page 44 / 64
» Efficient Mining of Generalized Negative Association Rules
Sort
View
CAEPIA
2003
Springer
14 years 28 days ago
Text Mining Using the Hierarchical Syntactical Structure of Documents
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
Roxana Dánger, José Ruiz-Shulcloper,...
KAIS
2008
114views more  KAIS 2008»
13 years 7 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
APWEB
2005
Springer
14 years 1 months ago
A Fast Algorithm for Mining Share-Frequent Itemsets
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
PADL
2000
Springer
13 years 11 months ago
Calculating a New Data Mining Algorithm for Market Basket Analysis
The general goal of data mining is to extract interesting correlated information from large collection of data. A key computationally-intensive subproblem of data mining involves ...
Zhenjiang Hu, Wei-Ngan Chin, Masato Takeichi
KDD
2004
ACM
192views Data Mining» more  KDD 2004»
14 years 8 months ago
Mining and summarizing customer reviews
Merchants selling products on the Web often ask their customers to review the products that they have purchased and the associated services. As e-commerce is becoming more and mor...
Minqing Hu, Bing Liu