• Corpus ID: 18107839

In Search of a Bridge Between Network Analysis in Computational Linguistics and Computational Biology - A Conceptual Note

  title={In Search of a Bridge Between Network Analysis in Computational Linguistics and Computational Biology - A Conceptual Note},
  author={Alexander Mehler},
Recently, the inference of biological networks has been studied whose vertices represent proteins and recurrent sequential patterns – called domain types – thereof; cf., for example, [1]. What makes this an outstanding research object from the point of view of data mining is the explorative analysis of large networks whose emergence is simulated in order to get insights into the dynamics of the focal area. This research program is connected to analyzing informational and, especially, textual… 

Figures from this paper

A Large Scale Analysis of Information-Theoretic Network Complexity Measures Using Chemical Structures
Light is shed on the relatedness between some selected information measures for graphs by performing a large scale analysis using chemical networks, and the uniqueness of network complexity measures numerically is evaluated.
  • M. Dehmer
  • Computer Science
    Appl. Artif. Intell.
  • 2008
A method for determining the structural information content of graphs that is based on a tree decomposition and it turns out that the computational complexity of the underlying algorithm is polynomial.
Contextual polarity and influence mining in online social networks
  • Hassan Alzahrani, P. Duverger, Nam P. Nguyen
  • Computer Science
    2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)
  • 2017
Starbucks’ crowdsourcing platform, Ideas Starbucks, is examined, with three objectives: first, to determine crowdsourcing participants’ perception of the company by crowdsourced participants when generating ideas on the platform, and to map users into a community structure to identify those more likely to produce ideas.
A Brief Introduction to Complex Networks and Their Analysis
The focus of this chapter is on the structural analysis of networks, however, information-theoretic methods are also discussed.
On Nonnegative Signed Domination in Graphs and its Algorithmic Complexity
E xact values are found for cycle s, stars, wheels, spiders and complete equally bipartite graphs and some lower bounds for nonnegative signed domination number are presented in terms of the order and the maximum and minimum degree.
Using a Taxonomy of Differential Step Functioning to Improve the Interpretation of DIF in Polytomous Items: An Illustration
The assessment of differential item functioning (DIF) in polytomous items addresses between-group differences in measurement properties at the item level, but typically does not inform which score


Probabilistic inference of molecular networks from noisy data sources
A probabilistic model useful for predicting protein interactions from heterogeneous data sources is introduced and the prediction limits are explored, given experimental data that cover only part of the underlying protein networks.
Untangling Text Data Mining
Data mining, information access, and corpus-based computational linguistics are defined and the relationship of these to text data mining is discussed, and the intent behind these contrasts is to draw attention to exciting new kinds of problems for computational linguists.
Network motifs in the transcriptional regulation network of Escherichia coli
This work applied new algorithms for systematically detecting network motifs to one of the best-characterized regulation networks, that of direct transcriptional interactions in Escherichia coli, and finds that much of the network is composed of repeated appearances of three highly significant motifs.
The Structure and Function of Complex Networks
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Automatic Acquisition and Efficient Representation of Syntactic Structures
The distributional principle according to which morphemes that occur in identical contexts belong, in some sense, to the same category is extended by applying it recursively, and by using mutual information for estimating category coherence.
Subgraphs in random networks.
It is found that certain subgraphs appear much more frequently than in Erdos networks, and the power exponent of the degree distribution, gamma, is used as a control parameter, and it is shown that random networks exhibit transitions between three regimes.
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
A Systems Biology approach for the classification of DNA Microarray Data
The main idea of this BGC is to decompose a graph locally in generalized trees forming the tree set of a graph and to compare the tree sets of graphs by a generalized tree-similarity algorithm (GTSA).
Text Linkage in the Wiki Medium - A Comparative Study
The study provides evidence that a more appropriate network model is needed which better reflects the specifics of wiki systems and puts emphasize on their topological differences as a result of wiki-related linking compared to other text-based networks.
On Semantic Spaces
The aim is to demonstrate the similarities of apparently different approaches to semantic spaces and to inspire the generalisation of semantic spaces tailored to the representation of texts to arbitrary semiotic artefacts.