Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2498328.2500045acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
research-article

Mining probabilistic generalized frequent itemsets in uncertain databases

Published: 04 April 2013 Publication History

Abstract

Researchers have recently defined and presented the theoretical concepts and an algorithm necessary for mining so-called probabilistic frequent itemsets in uncertain databases---based on possible world semantics. Further, there exist algorithms for mining so-called generalized itemsets in certain databases, where a taxonomy exists relating concrete items to abstract (generalized) items not in the database. Currently, no research has been done in formulating a theory and algorithm for mining generalized itemsets from uncertain databases. Using probability theory and possible world semantics, we formulate a method for calculating the probability a generalized item will occur within an uncertain transaction.

References

[1]
R. Agrawal, T. Imieliński, and A. Swami. Mining association rules between sets of items in large databases. Proc. ACM SIGMOD Int. Conf. on Management of Data, June 1993.
[2]
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. Proc. 20th Int. Conf. Very Large Data Bases, Jan. 1994.
[3]
T. Bernecker, H.-P. Kriegel, M. Renz, and F. Verhein. Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain Databases (Technical Report). arXiv.org, cs.DB, Aug. 2010.
[4]
T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, and A. Zuefle. Probabilistic frequent itemset mining in uncertain databases. Proc. 15th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pages 119--127, June 2009.
[5]
H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. Knowledge Discovery in Databases, pages 181--192, 1994.
[6]
R. Srikant and R. Agrawal. Mining Generalized Association Rules. Research Report, 1995.
[7]
K. Sriphaew and T. Theeramunkong. A New Method for Finding Generalized Frequent Itemsets in Generalized Association Rule Mining. Proc. 7th Int. Symposium on Computers and Communications, July 2002.
[8]
L. Wang, R. Cheng, S. D. Lee, and D. Cheung. Accelerating probabilistic frequent itemset mining: a model-based approach. In Proc. 19th ACM Int. Conf. on Information and Knowledge Management, pages 429--438, Oct. 2010.

Cited By

View all
  • (2020)Efficient weighted probabilistic frequent itemset mining in uncertain databasesExpert Systems10.1111/exsy.1255138:5Online publication date: 7-Apr-2020
  • (2015)Probabilistic Frequent Itemset Mining with Hierarchical Background KnowledgeInternational Journal of Knowledge Engineering-IACSIT10.7763/IJKE.2015.V1.161:2(92-99)Online publication date: 2015

Index Terms

  1. Mining probabilistic generalized frequent itemsets in uncertain databases

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      ACMSE '13: Proceedings of the 51st annual ACM Southeast Conference
      April 2013
      224 pages
      ISBN:9781450319010
      DOI:10.1145/2498328
      • General Chair:
      • Ashraf Saad
      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

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 04 April 2013

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. existential probability of generalized itemsets
      2. probabilistic generalized frequent itemsets
      3. uncertain databases

      Qualifiers

      • Research-article

      Conference

      ACM SE'13
      Sponsor:
      ACM SE'13: ACM Southeast Regional 2013
      April 4 - 6, 2013
      Georgia, Savannah

      Acceptance Rates

      Overall Acceptance Rate 502 of 1,023 submissions, 49%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 25 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2020)Efficient weighted probabilistic frequent itemset mining in uncertain databasesExpert Systems10.1111/exsy.1255138:5Online publication date: 7-Apr-2020
      • (2015)Probabilistic Frequent Itemset Mining with Hierarchical Background KnowledgeInternational Journal of Knowledge Engineering-IACSIT10.7763/IJKE.2015.V1.161:2(92-99)Online publication date: 2015

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media