Graph-based NLP
From Language and Information Technologies
Jump to: navigation, search
The goal of this research project is to investigate efficient graph-based representations of text, and explore the application of ranking models based on such graph structures to natural language processing tasks. We bring together methods from computational linguistics and graph-theory, and combine them into a suite of innovative approaches that will improve and ultimately solve difficult problems in natural language processing. Specifically, we are currently working on the application of graph centrality algorithms to problems such as word sense disambiguation, text summarization and keyword extraction.
So, a while ago, I’ve decided to code a library to plot some information I had. The idea was to create simple graphics in a way they would be easy to create, beautiful and good to present to people with no or few backgrounds on math and computers.
Graph mining refers to extracting knowledge from massive graphs. The data sets of telephone calls we see at AT&T can be viewed as a single graph, with several hundred million phone numbers as nodes, and calls between phone numbers as edges. It is a giant social network, like an internet connections graph or a rich citation network.
X. Wang, and M. Zhang. Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research, page 23341--23362. PMLR, (17--23 Jul 2022)
H. Nguyen, N. Nguyen, H. Doan, Z. Ahmadi, T. Doan, and L. Jiang. Proceedings of the ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, New York, NY, USA, Association for Computing Machinery, (November 2022)
J. Feng, Y. Chen, F. Li, A. Sarkar, and M. Zhang. Advances in Neural Information Processing Systems, 35, page 4776--4790. Curran Associates, Inc., (2022)
X. Liu, T. Zhu, H. Tan, and R. Zhang. The Semantic Web--ISWC 2022: 21st International Semantic Web Conference, Virtual Event, October 23--27, 2022, Proceedings, page 284--302. Springer, (2022)
I. Hubner, E. Deeds, and E. Shakhnovich. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 103 (47):
17747-17752(November 2006)