research-article

uCFS₂: an enhanced system that mines uncertain data for constrained frequent sets

Authors:

Carson Kai-Sang Leung,

Dale A. BrajczukAuthors Info & Claims

IDEAS '10: Proceedings of the Fourteenth International Database Engineering & Applications Symposium

Pages 32 - 37

https://doi.org/10.1145/1866480.1866486

Published: 16 August 2010 Publication History

Abstract

Frequent set mining searches for sets of items that are frequently co-occurring together. Existing algorithms mainly find all the frequent sets from precise data. However, there are real-life situations in which users are interested in only some tiny portions of the entire collection of frequent sets and/or the data to be mined are uncertain. Recently, a tree-based system was proposed to mine uncertain data for frequent sets that satisfy user-specified succinct constraints. However, non-succinct constraints exist. In this paper, we extend such a system to mine uncertain data for frequent sets that satisfy succinct as well as non-succinct constraints by effectively exploiting properties of these constraints.

References

[1]

}}C. C. Aggarwal et al. Frequent pattern mining with uncertain data. In Proc. KDD 2009, pp. 29--37.

Digital Library

[2]

}}R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487--499.

Digital Library

[3]

}}R. Agrawal et al. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD 1993, pp. 207--216.

Digital Library

[4]

}}R. J. Bayardo Jr. et al. Constraint-based rule mining in large, dense databases. In Data Mining and Knowledge Discovery, 4(2--3), July 2000, pp. 217--240.

Digital Library

[5]

}}T. Bernecker et al. Probabilistic frequent itemset mining in uncertain databases. In Proc. KDD 2009, pp. 119--127.

Digital Library

[6]

}}J.-F. Boulicaut and B. Jeudy. Mining free itemsets under constraints. In Proc. IDEAS 2001, pp. 322--329.

Digital Library

[7]

}}C.-K. Chui et al. Mining frequent itemsets from uncertain data. In Proc. PAKDD 2007, pp. 47--58.

Digital Library

[8]

}}X. Dai et al. Probabilistic spatial queries on existentially uncertain data. In Proc. SSTD 2005, pp. 400--417.

Digital Library

[9]

}}G. Grahne et al. Efficient mining of constrained correlated sets. In Proc. IEEE ICDE 2000, pp. 512--521.

Digital Library

[10]

}}J. Han et al. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1), Jan. 2004, pp. 53--87.

Digital Library

[11]

}}T.-Y. Jen et al. Mining frequent conjunctive queries in star schemas. In Proc. IDEAS 2009, pp. 97--108.

Digital Library

[12]

}}L. V. S. Lakshmanan, C. K.-S. Leung, and R. Ng. Efficient dynamic mining of constrained frequent sets. ACM TODS, 28(4), Dec. 2003, pp. 337--389.

Digital Library

[13]

}}C. K.-S. Leung and D. A. Brajczuk. Efficient algorithms for the mining of constrained frequent patterns from uncertain data. ACM SIGKDD Explorations, 11(2), Dec. 2009, pp. 123--130.

Digital Library

[14]

}}C. K.-S. Leung. Frequent itemset mining with constraints. Encyclopedia of Database Systems, pp. 1179--1183.

[15]

}}C. K.-S. Leung and D. A. Brajczuk. Mining uncertain data for constrained frequent sets. In Proc. IDEAS 2009, pp. 109--120.

Digital Library

[16]

}}C. K.-S. Leung, B. Hao, and D. A. Brajczuk. Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In ACM SAC 2010, pp. 1034--1038.

Digital Library

[17]

}}C. K.-S. Leung, M. A. F. Mateo, and D. A. Brajczuk. A tree-based approach for frequent pattern mining from uncertain data. In Proc. PAKDD 2008, pp. 653--661.

Digital Library

[18]

}}C. K.-S. Leung et al. An effective multi-layer model for controlling the quality of data. In Proc. IDEAS 2007, pp. 28--36.

Digital Library

[19]

}}C. K.-S. Leung et al. CanTree: a canonical-order tree for incremental frequent-pattern mining. KAIS, 11(3), Apr. 2007, pp. 287--311.

Digital Library

[20]

}}C. K.-S. Leung et al. Efficient algorithms for stream mining of constrained frequent patterns in a limited memory environment. In Proc. IDEAS 2008, pp. 189--198.

Digital Library

[21]

}}R. T. Ng et al. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD 1998, pp. 13--24.

Digital Library

[22]

}}J. Pei et al. Pushing convertible constraints in frequent itemset mining. Data Mining and Knowledge Discovery, 8(3), May 2004, pp. 227--252.

Digital Library

[23]

}}Q. Zhang et al. Finding frequent items in probabilistic data. In Proc. ACM SIGMOD 2008, pp. 819--832.

Digital Library

Cited By

Bhogadhi VChandak M(2017)A Review of Frequent Pattern Mining Algorithms for Uncertain DataProceedings of SAI Intelligent Systems Conference (IntelliSys) 201610.1007/978-3-319-56991-8_73(974-983)Online publication date: 23-Aug-2017
https://doi.org/10.1007/978-3-319-56991-8_73
Leung C(2014)Uncertain Frequent Pattern MiningFrequent Pattern Mining10.1007/978-3-319-07821-2_14(339-367)Online publication date: 30-Aug-2014
https://doi.org/10.1007/978-3-319-07821-2_14
de Carvalho JRuiz D(2013)Discovering frequent itemsets on uncertain dataProceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition10.1007/978-3-642-39712-7_30(390-404)Online publication date: 19-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39712-7_30
Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

IDEAS '10: Proceedings of the Fourteenth International Database Engineering & Applications Symposium

August 2010

282 pages

ISBN:9781605589008

DOI:10.1145/1866480

General Chair:
Bipin C. Desai
Concordia University, Montréal, QC, Canada
,
Program Chair:
Jorge Bernardino
Instituto Politecnico de Coimbra, Portugal

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

ACM: Association for Computing Machinery
BytePress
Concordia University: Concordia University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 August 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

IDEAS '10

Sponsor:

ACM
Concordia University

IDEAS '10: Fourteenth International Database Engineering & Applications

August 16 - 18, 2010

Quebec, Montreal, Canada

Acceptance Rates

Overall Acceptance Rate 74 of 210 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
106
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bhogadhi VChandak M(2017)A Review of Frequent Pattern Mining Algorithms for Uncertain DataProceedings of SAI Intelligent Systems Conference (IntelliSys) 201610.1007/978-3-319-56991-8_73(974-983)Online publication date: 23-Aug-2017
https://doi.org/10.1007/978-3-319-56991-8_73
Leung C(2014)Uncertain Frequent Pattern MiningFrequent Pattern Mining10.1007/978-3-319-07821-2_14(339-367)Online publication date: 30-Aug-2014
https://doi.org/10.1007/978-3-319-07821-2_14
de Carvalho JRuiz D(2013)Discovering frequent itemsets on uncertain dataProceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition10.1007/978-3-642-39712-7_30(390-404)Online publication date: 19-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39712-7_30
Leung CTanbeer SBudhia BZacharias LDesai BPokorny JBernardino J(2012)Mining probabilistic datasets verticallyProceedings of the 16th International Database Engineering & Applications Sysmposium10.1145/2351476.2351500(199-204)Online publication date: 8-Aug-2012
https://dl.acm.org/doi/10.1145/2351476.2351500
Leung CJiang FSun LWang YDesai BPokorny JBernardino J(2012)A constrained frequent pattern mining system for handling aggregate constraintsProceedings of the 16th International Database Engineering & Applications Sysmposium10.1145/2351476.2351479(14-23)Online publication date: 8-Aug-2012
https://dl.acm.org/doi/10.1145/2351476.2351479
Chowdhury NLeung C(2011)Improved travel time prediction algorithms for intelligent transportation systemsProceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II10.5555/2041341.2041380(355-365)Online publication date: 12-Sep-2011
https://dl.acm.org/doi/10.5555/2041341.2041380
Leung CJiang FHayduk YDesai BCruz IBernardino J(2011)A landmark-model based system for mining frequent patterns from uncertain data streamsProceedings of the 15th Symposium on International Database Engineering & Applications10.1145/2076623.2076659(249-250)Online publication date: 21-Sep-2011
https://dl.acm.org/doi/10.1145/2076623.2076659

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents