Sciweavers

77 search results - page 2 / 16
» Clustering Transactions Using Large Items
Sort
View
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 10 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 6 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
RTCSA
1999
IEEE
13 years 10 months ago
Adaptive Data Broadcast Strategy for Transactions with Multiple Data Requests in Mobile Computing Environments
Data Broadcast in mobile environments has received much attention in recent years and a large number of algorithms proposed. However, existing work in the literature only assume a ...
Joe Chun-Hung Yuen, Edward Chan, Kam-yiu Lam
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 6 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
CAINE
2009
13 years 3 months ago
Clustering Customer Transactions: A Rough Set Based Approach
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...
Arunava Saha, Darsana Das, Dipanjan Karmakar, Dili...