58 search results - page 5 / 12 » Pushing Tougher Constraints in Frequent Pattern Mining |
167
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
158
click to vote
COMPUTE
2010
ACM
15 years 10 months ago
2010
ACM
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
180
click to vote
DAWAK
2005
Springer
15 years 11 months ago
2005
Springer
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user speci...
147
click to vote
ICDM
2007
IEEE
16 years 7 days ago
2007
IEEE
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
152
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...