Maximizing agreement with a classification by bounded or unbounded number of associated words

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

Volumn 1533 LNCS, Issue , 1998, Pages 39-49

  Arimura, Hiroki ^a   Shimozono, Shinichi ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BINARY LABELS; EXPECTED TIME; MAX SNP-HARD; MAXIMIZING AGREEMENTS; RANDOM STRING; TOTAL LENGTH; WORD ASSOCIATION;

ARTIFICIAL INTELLIGENCE;

EID: 84867481378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_6     Document Type: Conference Paper

References (14)

1. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases. In Proc. the ACM SIGMOD Conference on Management of Data (1993), 207-216.
2. G. Ausiello, P. Crescenzi, M. Protasi, Approximate solution of NP optimization problems. Theor. Comput. Sc., 150, 1-55 (1995).
3. H. Arimura, A. Wataki, R. Fujino, S. Arikawa, A fast algorithm for discovering optimal string patterns in large text databases. DOI-TR-148, Kyushu Univ. (To appear in Proc. the 9th Int. Workshop on Algorithmic Learning Theory)
4. L. Devroye, W. Szpankowski, B. Rais, A note on the height of the suffix trees. SIAM J. Comput., 21, 48-53 (1992).
5. D. P. Dobkin, D. Gunopulos, W. Maass, Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning. J. Comut. Sys. Sci., 52, 453-470 (1996).
6. T. Fukuda, Y. Morimoto, S. Morishita, T. Tokuyama, Data mining using two-dimensional optimized association rules. In Proc. 1996 SIGMOD (1996), 13-23.
7. D. S. Johnson, Approximation algorithms for combinatorial problems. J. Comut. Sys. Sci., 9, 256-278 (1974).
8. M. J. Kearns, R. E. Shapire, L. M. Sellie, Toward efficient agnostic learning. Machine Learning, 17, 115-141, (1994).
9. U. Manber, R. Baeza-Yates, An algorithm for string matching with a sequence of don't cares. Inf. Procc. Lett., 37, 133-136 (1991).
10. E. M. McCreight, A space-economical suffix tree construction algorithm. J. ACM, 23, 262-272 (1976).
11. S. Miyano, A. Shinohara and T. Shinohara, Which classes of elementary formal systems are polynomial-time learnable. Proc. 2nd Workshop on Algorithmic Learning Theory, 139-150 (1991).
12. M. Nakanishi, M. Hashidume, M. Ito, A. Hashimoto, A linear-time algorithm for computing characteristic strings. In Proc. 5th ISAAC (1994), 315-323.
13. C. H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes. J. Comput. Sys. Sci., 43, 425-440 (1991).
14. J. T.-L. Wang, G.-W. Chirn, T. G. Marr, B. Shapiro, D. Shasha, K. Zhang. Combinatorial pattern discovery for scientific data: some preliminary results. In Proc. 1994 SIGMOD (1994), 115-125.