Sciweavers

226 search results - page 26 / 46
» Attribute Generation Based on Association Rules
Sort
View
ICFCA
2007
Springer
15 years 3 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...
CGF
2008
126views more  CGF 2008»
14 years 9 months ago
Part-type Segmentation of Articulated Voxel-Shapes using the Junction Rule
We present a part-type segmentation method for articulated voxel-shapes based on curve skeletons. Shapes are considered to consist of several simpler, intersecting shapes. Our met...
Dennie Reniers, Alexandru Telea
SNAM
2011
246views more  SNAM 2011»
14 years 4 months ago
Market basket analysis with networks
The field of market basket analysis, the search for meaningful associations in customer purchase data, is one of the oldest areas of data mining. The typical solution involves th...
Troy Raeder, Nitesh V. Chawla
DAWAK
2010
Springer
14 years 10 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
DIS
2008
Springer
14 years 11 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...