An information theoretic approach to detection of minority subsets in database

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 11-20

  Ando, Shin ^a   Suzuki, Einoshin ^b  

^a YOKOHAMA NATIONAL UNIVERSITY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONVENTIONAL DISTANCE; CRITICAL PARAMETERS; INFORMATION THEORETIC FRAMEWORK; MINORITY SUBSETS; RATE DISTORTION THEORY;

DATA ACQUISITION; INFORMATION RETRIEVAL SYSTEMS; INFORMATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

DATABASE SYSTEMS;

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

References (26)

1. C. C. Aggarwal and P. S. Yu. Outlier detection for high dimensional data. In SIGMOD '01: Proceedings of the 2001 ACM SIGMOD international conference on Management of data, pages 37-46, New York, NY, USA, 2001. ACM Press.
2. A. Banerjee, I. S. Dhillon, J. Ghosh, and S. Merugu. An information theoretic analysis of maximum likelihood mixture estimation for exponential families. In C. E. Brodley, editor, Machine Learning, Proceedings of the Twenty-first International Conference. ACM, 2004.
3. R. Bekkerman, R. El-Yaniv, N. Tishby, and Y Winter. Distributional word clusters vs. words for text categorization. Journal of Machine Learning Research, 3:1183-1208, 2003.
4. T.Berger. Rate distortion theory; a mathematical basis for data compression. Prentice-Hall, Englewood Cliffs, N.J., 1971.
5. R. E. Blahut. Computation of channel capacity and ratedistortion functions. IEEE Trans. Inform. Theory, IT18:460-473, July 1972.
6. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander. LOF: Identifying density-based local outliers. In W. Chen, J. F. Naughton, and P. A. Bernstein, editors, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pages 93-104. ACM, 2000.
7. T. M. Cover and J. A. Thomas. Elements of information theory. J. Wiley, Hoboken, N.J., 2nd edition, 2005.
8. K. Crammer and G. Chechik. A needle in a haystack: local one-class optimization. In Proceedings of the 21st International Conference on Machine learning, page 26, New York, NY, USA, 2004. ACM Press.
9. I. S. Dhillon, S. Mallela, and R. Kumar. A divisive information-theoretic feature clustering algorithm for text classification. Journal of Machine Learning Research, 3:1265-1287, 2003.
10. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A densitybased algorithm for discovering clusters in large spatial databases with noise. In U. M. F. Evangelos Simoudis, Jiawei Han, editor, Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 226-231, 1996.
11. L. Hermes, T Zöller, and J. M. Buhmann. Parametric distributional clustering for image segmentation. In A. Heyden, G. Sparr, M. Nielsen, and P. Johansen, editors, European Conference on Computer Vision (ECCV 3), pages 577-591, 2002.
12. A. Hinneburg and D. A. Keim. A general approach to clustering in large databases with noise. Knowl. Inf. Syst., 5(4):387-415, 2003.
13. M. V. Joshi, R. C. Agarwal, and V. Kumar. Mining needle in a haystack: classifying rare classes via two-phase rule induction. In SIGMOD '01: Proceedings of the 2001 ACM SIGMOD international conference on Management of data, pages 91-102, New York, NY, USA, 2001. ACM Press.
14. E. M. Knorr, R. T. Ng, and V. Tucakov. Distance-based outliers: Algorithms and applications. VLDB Journal: Very Large Data Bases, 8(3-4):237-253, 2000.
15. R. M. Neal and G. E. Hinton. A view of the EM algorithm that justies incremental, sparse, and other variants, pages 355-368. MIT Press, Cambridge, MA, USA, 1999.
16. K. Nigam, A. McCallum, S. Thrun, and T M. Mitchell. Text classification from labeled and unlabeled documents using em. Machine Learning, 39(2/3):103-134, 2000.
17. Y. Ohsawa and P. McBurney. Chance disco very. Advanced information processing. Springer, Berlin ; New York, 2003.
18. R. Redner and H. Walker. Mixture densities, maximum likelihood and the EM algorithm. SIAM Review, 26(2): 195-239, 1984.
19. B. Schölkopf, J. C. Platt, J. Shawe-Taylor, A. J. Smola, and R. C. Williamson. Estimating the support of a high-dimensional distribution. Neural Computation, 13(7): 1443-1471, 2001.
20. B. W. Silverman. Density estimation for statistics and data analysis. Monographs on statistics and applied probability. Chapman and Hall, London, 1986.
21. N. Slonim and N. Tishby. Document clustering using word clusters via the information bottleneck method. In SIGIR, pages 208-215, 2000.
22. E. Suzuki and J. M. Zytkow. Unified algorithm for undirected discovery of exception rules. Int. J. Intell. Syst., 20(6): 673-691, 2005.
23. N. Tishby, F. C. Pereira, and W. Bialek. The information bottleneck method. Computing Research Repository(CoRR), physics/0004057, 2000.
24. C. J. Van Rijsbergen. Information retrieval. Butterworths, London ; Boston, 2nd edition, 1979.
25. V. N. Vapnik. The nature of statistical learning theory. Springer, New York, 1995.
26. M. Welling and K. Kurihara. Bayesian k-means as a "maximization- expectation" algorithm. In Proceedings of 2006 SIAM Conference on Data Mining (SDM06), pages 472-476, 2006.