The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis
Open accessAbstract
We present a novel approach to the automatic acquisition of taxonomies or concept hierarchies from a text corpus. The approach is based on Formal Concept Analysis (FCA), a method mainly used for the analysis of data, i.e. for investigating and processing explicitly given information. We follow Harris' distributional hypothesis and model the context of a certain term as a vector representing syntactic dependencies which are automatically acquired from the text corpus with a linguistic parser. On the basis of this context information, FCA produces a lattice that we convert into a special kind of partial order constituting a concept hierarchy. The approach is evaluated by comparing the resulting concept hierarchies with hand-crafted taxonomies for two domains: tourism and finance. We also directly compare our approach with hierarchical agglomerative clustering as well as with Bi-Section-KMeans as an instance of a divisive clustering algorithm. Furthermore, we investigate the impact of using different measures weighting the contribution of each attribute as well as of applying a particular smoothing technique to cope with data sparseness.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
WordNet: An Electronic Lexical Database
Kilgarriff, A., & Fellbaum, C. (2000) · Language · doi:10.2307/417141 · Cited by 11,464
Formal Concept Analysis: Mathematical Foundations
Ganter, B., Wille, R., & Franzke, C. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,245
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
Automatic acquisition of hyponyms from large text corpora
Hearst, M. A. (1992) · Proceedings of the 14th conference on Computational linguistics - · doi:10.3115/992133.992154 · Cited by 3,253
A Comparison of Document Clustering Techniques
Steinbach, M. S., Karypis, G., & Kumar, V. (2000) · Cited by 2,532
Duda, R. O., Hart, P. E., & Stork, D. G. (2001) · Cited by 2,463
English Verb Classes and Alternations: A Preliminary Investigation
Tenny, C., & Levin, B. (1995) · Language · doi:10.2307/415968 · Cited by 2,299
SLINK: An optimally efficient algorithm for the single-link cluster method
Sibson, R. (1973) · The Computer Journal · doi:10.1093/comjnl/16.1.30 · Cited by 1,203
Distributional clustering of English words
Pereira, F., Tishby, N., & Lee, L. (1993) · Proceedings of the 31st annual meeting on Association for Computational Linguistics - · doi:10.3115/981574.981598 · Cited by 974
Efficient algorithms for agglomerative hierarchical clustering methods
Day, W. H. E., & Edelsbrunner, H. (1984) · Journal of Classification · doi:10.1007/bf01890115 · Cited by 971
Mathematical structures of language
Harris, Z. S. (1968) · Medical Entomology and Zoology · Cited by 957
Query Expansion using Lexical-Semantic Relations
Voorhees, E. M. (1994) · SIGIR ’94 · doi:10.1007/978-1-4471-2099-5_7 · Cited by 947
Measuring Similarity between Ontologies
Maedche, A., & Staab, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45810-7_24 · Cited by 785
Self-citationExplorations in Automatic Thesaurus Discovery
Grefenstette, G. (1994) · Springer eBooks · doi:10.1007/978-1-4615-2710-7 · Cited by 749
Deriving concept hierarchies from text
Sanderson, M., & Croft, B. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312679 · Cited by 612
Measures of distributional similarity
Lee, L. (1999) · Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics - · doi:10.3115/1034678.1034693 · Cited by 583
Noun classification from predicate-argument structures
Hindle, D. (1990) · Proceedings of the 28th annual meeting on Association for Computational Linguistics - · doi:10.3115/981823.981857 · Cited by 545
Automatic construction of a hypernym-labeled noun hierarchy from text
Caraballo, S. A. (1999) · Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics - · doi:10.3115/1034678.1034705 · Cited by 373
Ontologies improve text document clustering
Hotho, A., Staab, S., & Stumme, G. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250972 · Cited by 355
Self-citationOn the editing distance between unordered labeled trees
Zhang, K., Statman, R., & Shasha, D. E. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90136-j · Cited by 324
Selectional Preference and Sense Disambiguation
Resnik, P. (1997) · Cited by 221
Text Mining for Causal Relations
Gîrju, R., & MOLDOVAN, D. I. (2002) · Cited by 185
Ontology Learning Part One — on Discovering Taxonomic Relations from the Web
Maedche, A., Pekar, V., & Staab, S. (2003) · Web Intelligence · doi:10.1007/978-3-662-05320-1_14 · Cited by 102
Self-citationAcquiring Lexical Knowledge for Anaphora Resolution
Poesio, M., Ishikawa, T., Walde, S. S. I., & Vieira, R. L. R. (2002) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/3vp7obnb6oct · Cited by 90
Text Classification by Boosting Weak Learners based on Terms and Concepts
Bloehdorn, S., & Hotho, A. (2005) · Proceedings · doi:10.1109/icdm.2004.10077 · Cited by 84
Self-citationFinding all closed sets: A general approach
Ganter, B., & Reuter, K. (1991) · Order · doi:10.1007/bf00383449 · Cited by 80
Graph similarity and distance in graphs
Chartrand, G., Kubicki, G., & Schultz, M. (1998) · Aequationes Mathematicae · doi:10.1007/s000100050025 · Cited by 70
Grefenstetti, G. (1996) · The MIT Press eBooks · Cited by 61
GETESS—Searching the Web Exploiting German Texts
Staab, S., Braun, C., Bruder, I., et al. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48414-0_7 · Cited by 52
Self-citation
Cited by
SimLex-999: Evaluating Semantic Models With (Genuine) Similarity Estimation
Hill, F., Reichart, R., & Korhonen, A. (2015) · Computational Linguistics · doi:10.1162/coli_a_00237 · Cited by 1,175
The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
Blei, D. M., Griffiths, T. L., & Jordan, M. I. (2010) · Journal of the ACM · doi:10.1145/1667053.1667056 · Cited by 646
Measuring the complexity of the law: the United States Code
Katz, D. M., & Bommarito, M. J. (2014) · Artificial Intelligence and Law · doi:10.1007/s10506-014-9160-8 · Cited by 117
Metadata
- Authors
- Cimiano, P., Hotho, A., & Staab, S.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2005-08-01
- Volume
- 24
- Pages
- 305-339
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2123982464
- Cited by
- 522
- References
- 30
- FWCI
- 32.29
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.