Distances between data sets based on summary statistics

Journal of Machine Learning Research

Volumn 8, Issue , 2007, Pages 131-154

  Tatti, Nikolaj ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Binary data; Complex data; Data mining theory; Itemsets

Indexed keywords

COMPUTATION THEORY; DATA REDUCTION; LINEAR SYSTEMS; STATISTICAL METHODS;

BINARY DATA; COMPLEX DATA; DATA MINING THEORY; ITEMSETS;

DATA MINING;

EID: 33846500112     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. Rakesh Agrawal, Tomasz Imielinski, and Arun N. Swami. Mining association rules between sets of items in large databases. In Peter Buneman and Sushil Jajodia, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207-216, Washington, D.C., 26-28 1993.
2. Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and Aino I. Verkamo. Fast discovery of association rules. In Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, and Ramasamy Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press/The MIT Press, 1996.
3. Pierre Baldi, Paolo Frasconi, and Padhraic Smyth. Modeling the Internet and the Web. John Wiley & Sons, 2003.
4. Michéle Baseville. Distance measures for signal processing and pattern recognition. Signal Processing, 18(4):349-369, 1989.
5. Toon Calders. Axiomatization and Deduction Rules for the Frequency of Itemsets. PhD thesis, University of Antwerp, Belgium, 2003.
6. Tadeusz Calinski and Jerzy Harabasz. A dendrite method for cluster analysis. Communications in Statistics, 3:1-27, 1974.
7. Gregory Cooper. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 42(2-3):393-405, Mar. 1990.
8. Imre Csiszár. I-divergence geometry of probability distributions and minimization problems. The Annals of Probability, 3(1):146-158, Feb. 1975.
9. David L. Davies and Donald W. Bouldin. A cluster separation measure. IEEE Transactions of Pattern Analysis and Machine Intelligence, 1(2):224-227, April 1979.
10. Thomas Eiter and Heikki Mannila. Distance measures for point sets and their computation. Acta Informatica, 34(2):109-133, 1997.
11. Theodore Hailperin. Best possible inequalities for the probability of a logical function of events. The American Mathematical Monthly, 72(4):343-359, Apr. 1965.
12. David Hand, Heikki Mannila, and Padhraic Smyth. Principles of Data Mining. The MIT Press, 2001.
13. Jaakko Hollmén, Jouni K Seppänen, and Heikki Mannila. Mixture models and frequent sets: Combining global and local methods for 0-1 data. In Proceedings of the SIAM Conference on Data Mining (2003), 2003.
14. Solomon Kullback. Information Theory and Statistics. Dover Publications, Inc., 1968.
15. Vladimir I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady., 10(8):707-710, February 1966.
16. Heikki Mannila, Dmitry Pavlov, and Padhraic Smyth. Prediction with local patterns using cross-entropy. In Knowledge Discovery and Data Mining, pages 357-361, 1999.
17. Andrew Y. Ng, Michael I. Jordan, and Yair Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14, 2002.
18. Judea Pearl. Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1988.