Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FIMI
2003

favoriteEmaildiscussreport

136views Data Mining» more FIMI 2003»

Intersecting data to closed sets with constraints

13 years 5 months ago

Intersecting data to closed sets with constraints

Download sunsite.informatik.rwth-aachen.de

We describe a method for computing closed sets with data-dependent constraints. Especially, we show how the method can be adapted to ﬁnd frequent closed sets in a given data set. The current preliminary implementation of the method is quite inefﬁcient but more powerful pruning techniques could be used. Also, the method can be easily applied to wide variety of constraints. Regardless of the potential practical usefulness of the method, we hope that the sketched approach can shed some additional light to frequent closed set mining.

Taneli Mielikäinen

Real-time Traffic

Closed Set | Data Mining | Data-dependent Constraints | FIMI 2003 | Frequent Closed Set |

claim paper

Related Content

» Finding closed frequent item sets by intersecting transactions

» Set Intersection and Consistency in Constraint Networks

» Efficient closed pattern mining in the presence of tough block constraints

» BAMBOO Accelerating Closed Itemset Mining by Deeply Pushing the LengthDecreasing Support C...

» ConstraintBased Mining of Formal Concepts in Transactional Data

» Mining frequent closed rooted trees

» A completeness result for a realisability semantics for an intersection type system

» A ClosedForm Solution to Nonrigid Shape and Motion Recovery

» Constraint Satisfaction over Connected Row Convex Constraints

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	FIMI
Authors	Taneli Mielikäinen

Comments (0)