In this paper, we introduce BorderFlow, a novel local graph clustering algorithm, and its application to natural language processing problems. For this purpose, we first present a formal description of the algorithm. Then, we use BorderFlow to cluster large graphs and to extract concepts from word similarity graphs. The clustering of large graphs is carried out on graphs extracted from the Wikipedia Category Graph. The subsequent low-bias extraction of concepts is carried out on two data sets consisting of noisy and clean data. We show that BorderFlow efficiently computes clusters of high quality and purity. Therefore, BorderFlow can be integrated in several other natural language processing applications. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Ngomo, A. C. N., & Schumacher, F. (2009). Computational Linguistics and Intelligent Text Processing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5449, pp. 547–558). Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-67650535500&partnerID=tZOtx3y1
Mendeley helps you to discover research relevant for your work.