Compact and understandable descriptions of mixtures of bernoulli distributions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4723 LNCS, Issue , 2007, Pages 1-12

  Hollmén, Jaakko ^a   Tikka, Jarkko ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; DATA STRUCTURES; DISTRIBUTION FUNCTIONS; PARAMETER ESTIMATION; PROBABILITY;

BERNOULLI DISTRIBUTIONS; DATA SETS; NUMBER AMPLIFICATIONS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38049069697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74825-0_1     Document Type: Conference Paper

References (16)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the Twentieth International Conference on Very Large Data Bases (VLDB'94), pp. 487-499 (1994)
2. Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Proceedings of the 17th International Conference on Data Engineering (ICDE'2001), pp. 443-452 (2001)
3. Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistical Society, Series B 39, 1-38 (1977)
4. Good, P.: Permutation Tests - A Practical Guide to Resampling Methods for Testing Hypotheses, 2nd edn. Springer, Heidelberg (2000)
5. Gyllenberg, M., Koski, T.: Probabilistic models for bacterial taxonomy. TUCS Technical Report No 325, Turku Centre of Computer Science (January 2000)
6. Hollmén, J., Seppänen, J.K., Mannila, H.: Mixture models and frequent sets: combining global and local methods for 0-1 data. In: Barbará, D., Kamath, C. (eds.) Proceedings of the Third SIAM International Conference on Data Mining, pp. 289-293. Society of Industrial and Applied Mathematics (2003)
7. Hyvärinen, A., Karhunen, J., Oja, E.: Independent component analysis. John Wiley & Sons, Chichester (2001)
8. Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: Knowledge Discovery in databases: Papers form the AAAI-94 Workshop (KDD'94), pp. 181-192. AAAI Press (1994)
9. Myllykangas, S., Himberg, J., Böhling, T., Nagy, B., Hollmén, J., Knuutila, S.: DNA copy number amplification profiling of human neoplasms. Oncogene 25(55), 7324-7332 (2006)
10. Pavlov, D., Mannila, H., Smyth, P.: Beyond independence: Probabilistic models for query approximation on binary transaction data. IEEE Transactions on Knowledge and Data Engineering 15(6), 1409-1421 (2003)
11. Schaffer, L.G., Tommerup, N. (eds.): An International System for Human Cytogenetic Nomenclature. S. Karger, Basel (2005)
12. Sulkava, M., Tikka, J., Hollmén, J.: Sparse regression for analyzing the development of foliar nutrient concentrations in coniferous trees. Ecological Modeling 191(1), 118-130 (2006)
13. Tikka, J., Hollmén, J., Myllykangas, S.: Mixture modeling of DNA copy number amplification patterns in cancer. In: Sandoval, F., Prieto, A., Cabestany, J., Graña, M. (eds.) IWANN 2007. LNCS, vol. 4507, pp. 972-979. Springer, Heidelberg (2007)
14. Tikka, J., Lendasse, A., Hollmén, J.: Analysis of fast input selection: Application in time series prediction. In: Kollias, S., Stafylopatis, A., Duch, W., Oja, E. (eds.) ICANN 2006. LNCS, vol. 4132, pp. 161-170. Springer, Heidelberg (2006)
15. Vesanto, J., Hollmén, J.: An automated report generation tool for the data understanding phase. In: Abraham, A., Koeppen, M. (eds.) Proceedings of the First International Workshop on Hybrid Intelligent Systems (HIS'01), pp. 611-625. Springer, Heidelberg (2002)
16. Wolfe, J.W.: Pattern clustering by multivariate mixture analysis. Multivariate Behavioral Research 5, 329-350 (1970)