In sentiment classification, conventional supervised approaches heavily rely on a large amount of linguistic resources, which are costly to obtain for under-resourced languages. To overcome this scarce resource problem, there exist several methods that exploit graph-based semisupervised learning (SSL). However, fundamental issues such as controlling label propagation, choosing the initial seeds...

This paper introduces a graph-based semisupervised joint model of Chinese word segmentation and part-of-speech tagging. The proposed approach is based on a graph-based label propagation technique. One constructs a nearest-neighbor similarity graph over all trigrams of labeled and unlabeled data for propagating syntactic information, i.e., label distributions. The derived label distributions are...

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

Given a vertex-labeled graph, each vertex v is attached with a label from a set of labels. The vertex-label query desires the length of the shortest path from the given vertex to the set of vertices with the given label. We show how to construct an oracle if the given graph is planar, such that O( 1 ǫ n log n) storing space is needed, and any vertexlabel query could be answered in O( 1 ǫ log n ...

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

Gain graphs are graphs in which each edge has a gain (a label from a group, say ?, so that reversing the direction, inverses the gain). In this paper we take a generalized view of gain graphs in which the label of an edge is related to the label of the reverse edge by an involution. Applying selectors to gain graphs is a generalization of vertex-switching (or Seidel switching) of an undirected ...

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...