Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data

Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, KDD 1998

Volumn , Issue , 1998, Pages 112-120

  Steeg, Evan W ^a   Robinson, Derek ^a   Willis, Ed ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

ASSOCIATION MINING; COINCIDENCE DETECTION; DETECTION METHODS; FAST METHODS; HIGH ORDER CORRELATION; HIGH-DIMENSIONAL DATASET; HIGHER ORDER CORRELATION; HOEFFDING BOUND; MULTIDIMENSIONAL DATA; RANDOM SAMPLING;

ARTIFICIAL INTELLIGENCE;

EID: 84957705284     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Agrawal, R.; Mannila, H.; Srikant, R.; Toivonen, H.; and Verkamo, A. I. 1996. Fast discovery of associa¬tion rules. In Advances in Knowledge Discovery and Data Mining. American Association for Artificial In¬telligence. 307-328.
2. Agrawal, R.; Piatetsky-Shapiro, G.; and Padhraic, S. 1996. From data mining to knowledge discovery: An overview. In Advances in Knowledge Discovery and Data Mining. American Association for Artificial In¬telligence. 1-34.
3. Becker, S., and Plumbley, M. 1996. Unsupervised neural network learning procedures for feature extraction and classification. International Journal of Applied Intelligence 6(3).
4. Bengio, Y., and Frasconi, P. 1995. Diffusion of context and credit information in markovian models. JAIR 3:249-270.
5. Bourlard, H., and Wellekens, C. J. 1986. Connected speech recognition by phonemic semi-markov chains for state occupancy modeling. In Young, I. T., ed., Signal Processing III: Theories and Applications. El¬sevier Science Publishers B.V.
6. Fayyad, U. M.; Piatetsky-Shapiro, G.; Smyth, P.; and Uthurusamy, R., eds. 1996. Advances in Knowledge Discovery and Data Mining. American Association for Artificial Intelligence.
7. Fayyad, U. M.; Djorgovski, S. G.; and Weir, N. 1996. Automating the analysis and cataloging of sky sur¬veys. In Advances in Knowledge Discovery and Data Mining. American Association for Artificial Intelli¬gence. 471-493.
8. Hoeffding, W. 1963. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301):13-30.
9. Korber, B.; Färber, R.; Wolpert, D.; and Lapedes, A. 1993. Covariation of mutations in.the V3 loop of HIV- 1: An information-theoretic analysis. Proc. Nat. Acad. Sci. 90.
10. Krogh, A.; Brown, M.; Mian, I. S.; Sjolander, K.; and Haussler, D. 1994. Hidden Markov models in compu¬tational biology: Applications to protein modeling. J. Mol. Biol. 235:1501-1531.
11. Ku, H. H., and Kullback, S. 1969. Approximating discrete probability distributions. IEEE Transactions of Information Theory IT-15(4):444-447.
12. Lewis, P. M. 1959. Approximating probability distributions to reduce storage requirements. Information and Control 2:214-225.
13. MacKay, D. J. 1994. Bayesian neural networks and density networks. In Proceedings of Workshop on Neutron Scattering Data Analysis.
14. Miller, J. W. 1993. Building Probabilistic Models from Databases. Ph.D. Dissertation, California Institute of Technology, Pasadena, California.
15. Moore, A., and Lee, M. S. 1998. Cached sufficient statistics for efficient machine learning with large datasets. JAIR 8:67-91.
16. Sankoff, D.; Kruskal, J. B.; Mainville, S.; and Ced-ergren, R. J. 1983. Fast algorithms to determine RNA secondary structures containing multiple loops. In Sankoff, D., and Kruskal, J. B., eds., Time Warps, String Edits, and Macromolecules: The Theory and Practise of Sequence Comparison. Addison-Wesley.
17. Staden, R. 1984. Computer methods to locate sig¬nals in nucleic acid sequences. Nucleic Acids Research 12:505-519.
18. Steeg, E. W., and P h a m, H. 1998. Application of a novel and fast information-theoretic method to the discovery of higher-order correlations in protein databases. In Proceedings of the Pacific Symposium on Biocomputing.
19. Steeg, E. W. 1996. Automated Motif Discovery in Protein Structure Prediction. Ph.D. Dissertation, De¬partment of Computer Science, University of Toronto.
20. Toivonen, H. 1996. Sampling large databases for association rules. In Proceedings of the 22nd International Conference on Very Large Data Bases, 134-145.