Key semantics extraction by dependency tree mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 666-671

  Morinaga, Satoshi ^a   Arimura, Hiroki ^b   Ikeda, Takahiro ^a   Sakao, Yosuke ^a   Akamine, Susumu ^a  

^a NEC CORPORATION   (Japan)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

Phrase sentence reconstruc tion; Redundancy reduction; Syntactic dependency; Text mining; Tree enu meration

Indexed keywords

DATA MINING; NATURAL LANGUAGE PROCESSING SYSTEMS;

REDUNDANCY REDUCTION; SYNTACTIC DEPENDENCY; TDT;

SEMANTICS;

EID: 32344452294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081870.1081954     Document Type: Conference Paper

References (21)

1. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, and S. Arikawa: Efficient Substructure Discovery from Large Semi-structured Data, Proc. SDM'02, pp:158-174, SIAM, 2002.
2. T. Asai, H. Arimura, T. Uno, S. Nakano: Discovering Frequent Substructures In Large Unordered Trees, Proc. DS'03, LNAI 2843, Springer-Verlag, pp:47-61, 2003.
3. Y. Chi, Y. Yang, and R. R. Muntz: Indexing and mining free trees, Proc. IEEE ICDM'03, pp:509-512, 2003.
4. A. Inokuchi, T. Washio, H. Motoda: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, Proc. PKDD 2000, LNAI 1910, Springer-Verlag, pp:13-23, 2000.
5. D. Klein and C.D. Manning: Fast Exact Inference with a Factored Model for Natural Language Parsing, Proc. NIPS 2002, pp:3-10, 2002.
6. T. Kudo and Y. Matsumoto: A Boosting Algorithm for Classification of Semi-Structured Text, Proc. of EMNLP, pp:301-308, 2004.
7. M. Kuramochi, G. Karypis: Frequent Subgraph Discovery, Proc. IEEE ICDM'01, pp:313-320, 2001.
8. S. Morinaga and K. Yamanishi: Tracking Dynamics of Topic Trends Using a Finite Mixture Model, Proc. KDD2004, pp:811-816, 2004.
9. S. Morinaga, K. Yamanishi, K. Tateishi, and T. Fukushima: Mining Product Reputations on the Web, Proc. KDD2002, pp:341-349, 2002.
10. S. Nakano: Efficient generation of plane trees, IPL, vol. 84, pp:167-172, 2002.
11. S. Nijssen, J. N. Kok: Effcient Discovery of Frequent Unordered Trees, Proc. MGTS'03, pp:55-64, Sep. 2003.
12. J. Pei, J. Han: Constrained frequent pattern mining: a pattern-growth view, SIGKDD Explorations 4(1), pp:31-39, 2002.
13. Y. Sakao, T. Ikeda, K. Satoh, and S. Akamine: Japanese Language Analysis for Syntactic Tree Mining to Extract Characteristic Contents, Proc. of the 11th Annual Meeting of the Association for NLP, 2005. (in Japanese).
14. K. Satoh, T. Ikeda, T. Nakata, and S. Osada: Japanese Processing Middleware for Customer Relationship Management, in Proc. of the 9th Annual Meeting of the Association for NLP, pp.109-112, 2003. (in Japanese)
15. http://www-nlp.stanford.edu/software/lex-parser.shtml
16. http://www.nist.gov/speech/tests/tdt/
17. http://www.topicscope.com/ (in Japanese)
18. K. Yamanishi: A decision-theoretic extension of stochastic complexity and its applications to learning, IEEE Trans. on Information Theory, vol. 44(4), pp:1424-1439, 1998.
19. K. Yamanishi and H. Li: Mining open answers in questionnaire data, IEEE Intelligent Systems, Sept/Oct, pp:58-63, 2002.
20. X. Yan, J. Han: gSpan: Graph-Based Substructure Pattern Mining, Proc. IEEE ICDM'02, pp:721-724, 2002.
21. M. J. Zaki: Efficiently Mining Frequent Tress in a Forest, Proc. KDD2002, pp:71-80, 2002.