Sciweavers

503 search results - page 62 / 101
» Mining the optimal class association rule set
Sort
View
ICDM
2005
IEEE
129views Data Mining» more  ICDM 2005»
14 years 2 months ago
Mining Chains of Relations
Traditional data mining applications consider the problem of mining a single relation between two attributes. For example, in a scientific bibliography database, authors are rela...
Foto N. Afrati, Gautam Das, Aristides Gionis, Heik...
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 2 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
KAIS
2006
164views more  KAIS 2006»
13 years 9 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
MST
2010
117views more  MST 2010»
13 years 7 months ago
Class Constrained Bin Covering
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
EOR
2010
178views more  EOR 2010»
13 years 9 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...