skip to main content
10.1145/1529282.1529609acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Capturing truthiness: mining truth tables in binary datasets

Published:08 March 2009Publication History

ABSTRACT

We introduce a new data mining problem: mining truth tables in binary datasets. Given a matrix of objects and the properties they satisfy, a truth table identifies a subset of properties that exhibit maximal variability (and hence, complete independence) in occurrence patterns over the underlying objects. This problem is relevant in many domains, e.g., in bioinformatics where we seek to identify and model independent components of combinatorial regulatory pathways, and in social/economic demographics where we desire to determine independent behavioral attributes of populations. We outline a family of levelwise approaches adapted to mining truth tables, algorithmic optimizations, and applications to bioinformatics and political datasets.

References

  1. A. Gionis et al. Geometric and Combinatorial Tiles in 0--1 Data. In PKDD'04, pages 173--184, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. Owens et al. Capturing truthiness: Mining truth tables in binary datasets. Technical report, Virginia Tech, March 2007. http://eprints.cs.vt.edu/archive/00000948/.Google ScholarGoogle Scholar
  3. C. Silverstein et al. Beyond Market Baskets: Generalizing Association Rules to Dependence Rules. Data Mining and Knowledge Discovery, Vol. 2(1):pages 39--68, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Lin et al. Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set. IEEE TKDE, Vol. 14(3): 553--566, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Pavlov et al. Beyond Independence: Probabilistic Models for Query Approximation on Binary Transaction Data. IEEE TKDE, Vol. 15(6):pages 149--1421, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. F. Geerts et al. Tight Upper Bounds on the Number of Candidate Patterns. ACM Transactions on Database Systems, Vol. 30(2):pages 333--363, June 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. H. Xiong et al. TAPER: A Two-Step Approach for All-Strong-Pairs Correlation Query in Large Databases. IEEE TKDE, Vol. 18(4):pages 493--508, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Fitzgerald et al. Systems Biology and Combination Therapy in the Quest for Clinical Efficacy. Nature Chemical Biology, Vol. 2(9): 458--466, Sep 2006.Google ScholarGoogle ScholarCross RefCross Ref
  9. J. Seppanen et al. Dense Itemsets. In KDD'04, pages 683--688, Aug 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. K. Seppanen et al. Using and Extending Itemsets in Data Mining. PhD thesis, Helsinki University of Technology, 2006.Google ScholarGoogle Scholar
  11. J. L. Tuegels et al. Generalized Graphical Models for Discrete Data. Statistics and Probability Letters, Vol. 38: 41--47, May 1998.Google ScholarGoogle ScholarCross RefCross Ref
  12. K. Goldberg et al. Eigentaste: A Constant Time Collaborative Filtering Algorithm. Information Retrieval, Vol. 4(2):pages 133--151, July 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. L. O. Barrera et al. The transcriptional regulatory code of eukaryotic cells-insights from genome-wide analysis of chromatin organization and transcription factor binding. Curr Opin Cell Biol, 18(3): 291--8, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  14. M. Natarajan et al. A Global Analysis of Cross-talk in a Mammalian Cellular Signaling Network. Nature Cell Biology, Vol. 8(6): 571--580, June 2006.Google ScholarGoogle ScholarCross RefCross Ref
  15. M. J. Zaki et al. Reasoning about Sets using Redescription Mining. In KDD'05, pages 364--373, Aug 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. N. Ramakrishnan et al. Turning CARTwheels: An Alternating Algorithm for Mining Redescriptions. In KDD'04, pages 266--275, Aug 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. N. Tatti et al. What is the Dimension of your Binary Data? In ICDM'06, pages 603--612, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. R. Agrawal et al. Fast Algorithms for Mining Association Rules in Large Databases. In VLDB'94, pages 487--499, Sep 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. S. C. Madeira et al. Biclustering Algorithms for Biological Data Analysis: A Survey. IEEE/ACM TCBB, Vol. 1(1): 24--45, Jan 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T. Calders et al. Mining all non-derivable frequent itemsets. In PKDD'02, pages 74--85, London, UK, 2002. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. T. Lee et al. Transcriptional Regulatory Networks in Saccharomyces cerevisiae. Science, 298(5594): 799--804, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  22. Truthiness. Wikipedia. http://en.wikipedia.org/wiki/Truthiness.Google ScholarGoogle Scholar

Index Terms

  1. Capturing truthiness: mining truth tables in binary datasets

      Recommendations

      Comments

      Login options

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

      Sign in
      • Published in

        cover image ACM Conferences
        SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing
        March 2009
        2347 pages
        ISBN:9781605581668
        DOI:10.1145/1529282

        Copyright © 2009 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]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 8 March 2009

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,650of6,669submissions,25%
      • Article Metrics

        • Downloads (Last 12 months)2
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader