let $g=(v‎, ‎e)$ be a graph with $p$ vertices and $q$ edges‎. ‎an emph{acyclic‎ ‎graphoidal cover} of $g$ is a collection $psi$ of paths in $g$‎ ‎which are internally-disjoint and cover each edge of the graph‎ ‎exactly once‎. ‎let $f‎: ‎vrightarrow {1‎, ‎2‎, ‎ldots‎, ‎p}$ be a bijective‎ ‎labeling of the vertices of $g$‎. ‎let $uparrow!g_f$ be the‎ ‎directed graph obtained by orienting the...

Because there is so much randomness, the robustness of label propagation algorithm (LPA) is severely hampered. To reduce the randomness, a label propagation algorithm based on degree (LPAD) is proposed. Only the node with extreme degree is labeled initially, and the label is updated according to the sum degree of its neighbors during iteration. The results show that the randomness of LPAD is re...

A novel graph-based utterance generation method for open-domain dialogue systems is proposed in this paper. After an association graph of words and utterance patterns from a dialogue corpus is constructed, a label propagation algorithm is used for generating system utterances from the words and utterance patterns in the association graph that are found to strongly correlate with the words and u...

Knowledge of noun phrase anaphoricity might be profitably exploited in coreference resolution to bypass the resolution of non-anaphoric noun phrases. However, it is surprising to notice that recent attempts to incorporate automatically acquired anaphoricity information into coreference resolution have been somewhat disappointing. This paper employs a global learning method in determining the an...

This document provides a set of requirements for Advanced Multipath in MPLS networks. Advanced Multipath is a formalization of multipath techniques currently in use in IP and MPLS networks and a set of extensions to existing multipath techniques. Status of This Memo This document is not an Internet Standards Track specification; it is published for informational purposes. This document is a pro...

In the task of community detection, there often exists some useful prior information. In this paper, a Semi-supervised clustering approach using a new Evidential Label Propagation strategy (SELP) is proposed to incorporate the domain knowledge into the community detection model. The main advantage of SELP is that it can take limited supervised knowledge to guide the detection process. The prior...

In this paper, we present a group sparsity constrained patch based label propagation method for multi-atlas automatic brain labeling. The proposed method formulates the label propagation process as a graph-based theoretical framework, where each voxel in the input image is linked to each candidate voxel in each atlas image by an edge in the graph. The weight of the edge is estimated based on a ...

So-called classifier chains have recently been proposed as an appealing method for tackling the multi-label classification task. In this paper, we analyze the influence of a potential pitfall of the learning process, namely the discrepancy between the feature spaces used in training and testing: While true class labels are used as supplementary attributes for training the binary models along th...

Microblog messages pose severe challenges for current sentiment analysis techniques due to some inherent characteristics such as the length limit and informal writing style. In this paper, we study the problem of extracting opinion targets of Chinese microblog messages. Such fine-grained word-level task has not been well investigated in microblogs yet. We propose an unsupervised label propagati...

The label propagation has the benefits of nearly-linear running time and easy implementation. In this paper, we make use of the label propagation to propose a new weight measure, and present a supervised locality projection analysis (SLPA) method for plant leaf classification. Firstly, we apply Warshall algorithm to label propagation and get the label matrix, then incorporate it into the weight...