ACM Home Page
Please provide us with feedback. Feedback
Induction of semantic classes from natural language text
Full text PdfPdf (486 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
San Francisco, California
Pages: 317 - 322  
Year of Publication: 2001
ISBN:1-58113-391-X
Authors
Dekang Lin  University of Alberta, Edmonton, Alberta T6H 2E1 Canada
Patrick Pantel  University of Alberta, Edmonton, Alberta T6H 2E1 Canada
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
AAAI : American Association for Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 78,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/502512.502558
What is a DOI?

ABSTRACT

Many applications dealing with textual information require classification of words into semantic classes (or concepts). However, manually constructing semantic classes is a tedious task. In this paper, we present an algorithm, UNICON, for UNsupervised Induction of CONcepts. Some advantages of UNICON over previous approaches include the ability to classify words with low frequency counts, the ability to cluster a large number of elements in a high-dimensional space, and the ability to classify previously unknown words into existing clusters. Furthermore, since the algorithm is unsupervised, a set of concepts may be constructed for any corpus.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Arora, S. and Sagra, S. 1992. Approximating Clique is NP-Complete. In Proceedings of IEEE Symposium on Foundations of Computer Science. pp. 2.- 13.
 
3
Bomze, I. M., Budinich, M., Pardalos, P. M., and Pelillo, M. 1999. The maximum clique problem. Handbook of Combinatorial Optimization (Supplement Volume A). D.-Z. Du and P. M. Pardalos (Eds.). Kluwar Academic Publishers. Boston,/viA. pp. 1-74
 
4
5
 
6
 
7
 
8
Harris, Z. 1985. Distributional Structure. In: Katz, J. J. (ed.) The Philosophy of Linguistics. New York: Oxford University Press. pp. 26-47.
 
9
Hays, D. 1964. Dependency Theory: a Formalism and Some Observations. Language, 40:511-525.
 
10
Hudson, R. 1984. Word Grammar. Basil Blackwell Publishers Limited. Oxford, England.
 
11
Jing, Y. and Croft, W. B. 1994. An Association Thesaurus for Information Retrieval. In Proceedings of RIAO-94. pp. 146-160. New York.
 
12
Lin, D. 1998a. Extracting Collocations from Text Corpora. Workshop on Computational Terminology. pp. 57-63. Montreal, Canada.
 
13
 
14
15
 
16
Melcuk, I.A. 1987. Dependency Syntax: theory and practice. State University of New York Press. Albany, NY.
 
17
 
18
Resnik, P. 1998. Semantic Similarity in a Taxonomy: An Information-Based Measure and its Application to Problems of Ambiguity in Natural Language. Journal of Al Research, 11:95-130.
 
19
 
20

CITED BY  11

Collaborative Colleagues:
Dekang Lin: colleagues
Patrick Pantel: colleagues