What is the dimension of your binary data?

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 603-612

  Tatti, Nikolaj ^a   Mielikäinen, Taneli ^a   Gionis, Aristides ^a   Mannila, Heikki ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DATA; DATASETS; INDEPENDENT COLUMNS; NONTRIVIAL PROBLEMS;

COMPUTATIONAL METHODS; FRACTAL DIMENSION; PROBLEM SOLVING; ROBUST CONTROL;

DATA MINING;

EID: 72949095800     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.167     Document Type: Conference Paper

References (29)

1. D. Achlioptas. Database-friendly random projections: Johnson- lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4):671-687, 2003.
2. M. Anthony and N. Biggs. Computational Learning Theory: An Introduction. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1997.
3. M. Barnsley. Fractals Everywhere. Academic Press, 1988.
4. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. Journal of Machine Learning Research, 3:993-1022, 2003.
5. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 15-18, 1999, San Diego, CA, USA, pages 254-260. ACM, 1999.
6. W. Buntine and S. Perttu. Is multinomial PCA multi-faceted clustering or dimensionality reduction? In C. Bishop and B. Frey, editors, Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, pages 300-307, 2003.
7. B. Chazelle. The Discrepancy Method. Cambridge University Press, 2000.
8. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley, 1991.
9. C. Faloutsos and I. Kamel. Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In PODS, pages 4-13. ACM Press, 1994.
10. M. Fortelius. Neogene of the old world database of fossil mammals (NOW). University of Helsinki, http://www.helsinki.fi/science/now/, 2005.
11. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In E. Suzuki and S. Arikawa, editors, Discovery Science, volume 3245 of Lecture Notes in Computer Science, pages 278-289. Springer, 2004.
12. K. Geurts, G. Wets, T. Brijs, and K. Vanhoof. Profiling high frequency accident locations using association rules. In Proceedings of the 82nd Annual Transportation Research Board, Washington DC. (USA), January 12-16, 2003.
13. A. Gionis, A. Hinneburg, S. Papadimitriou, and P. Tsaparas. Dimension induced clustering. In R. Grossman, R. Bayardo, and K. P. Bennett, editors, KDD, pages 51-60. ACM, 2005.
14. I. Jolliffe. Principal Component Analysis. Springer Series in Statistics. Springer, 2nd edition, 2002.
15. B. Kégl. Intrinsic dimension estimation using packing numbers. In S. T. S. Becker and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, pages 681-688, 2003.
16. R. Kohavi, C. Brodley, B. Frasca, L. Mason, and Z. Zheng. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations, 2(2):86-98, 2000.
17. J. B. Kruskal. Multidimensional scaling by optimizing goodness of t to a nonmetric hypothesis. Psychometrica, 29:1-26, 1964.
18. K. Lang. Newsweeder: Learning to filter netnews. In Proceedings of the Twelfth International Conference on Machine Learning, pages 331-339, 1995.
19. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In T. K. Leen, T. G. Dietterich, and V. Tresp, editors, Advances in Neural Information Processing Systems 13, pages 556-562, 2001.
20. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science. Springer-Verlag, 3rd edition, 1997.
21. P. Miettinen, T. Mielikäinen, A. Gionis, G. Das, and H. Mannila. The discrete basis problem. In J. Fürnkranz, T. Scheffer, and M. Spiliopoulou, editors, Knowledge Discovery in Databases: PKDD 2006 - 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, Croatia, September 18-22, 2006, Proceedings, Lecture Notes in Computer Science. Springer, 2006.
22. S. D. Monson, N. J. Pullman, and R. Rees. A survey of clique and biclique coverings and factorizations of (0,1)-matrices. Bulletin of the ICA, 14:17-86, 1995.
23. E. Ott. Chaos in Dynamical Systems. Cambridge University Press, 1997.
24. B.-U. Pagel, F. Korn, and C. Faloutsos. Deflating the dimensionality curse using multiple fractal dimensions. In ICDE, pages 589-598. IEEE Computer Society, 2000.
25. P. Palmerini, S. Orlando, and R. Perego. Statistical properties of transactional databases. In H. Haddad, A. Omicini, R. L. Wainwright, and L. M. Liebrock, editors, SAC, pages 515-519. ACM, 2004.
26. C. H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the V-C dimension. Journal of Computer and System Sciences, 53(2): 161-170, 1996.
27. S. Papadimitriou, H. Kitagawa, P. B. Gibbons, and C. Faloutsos. LOCI: fast outlier detection using the local correlation integral. In U. Dayal, K. Ramamritham, and T. M. Vijayaraman, editors, ICDE, pages 315-326. IEEE Computer Society, 2003.
28. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.
29. C. Traina Jr., A. J. M. Traina, L. Wu, and C. Faloutsos. Fast feature selection using fractal dimension. In K. Becker, A. A. de Souza, D. Y. de Souza Fernandes, and D. C. F. Batista, editors, SBBD, pages 158-171. CEFET-PB, 2000.