Thesaurus as a complex network
Adriano de Jesus Holanda, Ivan Torres Pisa, Osame Kinouchi, Alexandre, Souto Martinez, Evandro Eduardo Seron Ruiz

TL;DR
This paper models a thesaurus as a directed complex network, analyzing link distributions and proposing new classification and arrangement methods based on network theory and stochastic growth models.
Contribution
It introduces a network-based representation of thesauri, analyzes link distributions, and proposes a novel arrangement method using the inversion technique.
Findings
Incoming link distribution follows a stretched exponential.
Outgoing link distribution fits a Ricatti differential equation solution.
Proposes a new thesaurus arrangement method.
Abstract
A thesaurus is one, out of many, possible representations of term (or word) connectivity. The terms of a thesaurus are seen as the nodes and their relationship as the links of a directed graph. The directionality of the links retains all the thesaurus information and allows the measurement of several quantities. This has lead to a new term classification according to the characteristics of the nodes, for example, nodes with no links in, no links out, etc. Using an electronic available thesaurus we have obtained the incoming and outgoing link distributions. While the incoming link distribution follows a stretched exponential function, the lower bound for the outgoing link distribution has the same envelope of the scientific paper citation distribution proposed by Albuquerque and Tsallis. However, a better fit is obtained by simpler function which is the solution of Ricatti's differential…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
