Related Topics
Experts

1

2

3

4

5

6

7

8

9

10
Publications (18)

1Expected Divergence Based Feature Selection for Learning to Rank2012  Parth Gupta,Paolo Rossosimilarity scores. The greedy search algorithm over an undirected graph of features was employed to solve the optimization problem...

2A Demo for Constructing Domain Ontology from Academic Papers2012  Feiliang Renhierarchical relation. The first step is to construct an undirected graph based on cooccurrence information among concepts....

3An Integrated Probabilistic and Logic Approach to Encyclopedia Relation Extraction with Multiple Features2008  Xiaofeng Yu,Wai LamWikipedia. The MLNs model entity relations in a unified undirected graph collectively using multiple features, including contextual...

4Contextual Modeling for Meeting Translation Using Unsupervised Word Sense Disambiguation2010  Mei Yang,Katrin Kirchhoffrepresents all word senses in a text as nodes in an undirected graph G = (V,E). Pairs of nodes are linked by edges weighted...

5A Global Relaxation Labeling Approach to Coreference Resolutionconcluded. 2 Graph Representation Let G = G(V,E) be an undirected graph where V is a set of vertices and E a set of edges. Let...

6MIEA: a Mutual Iterative Enhancement Approach for CrossDomain Sentiment Classificationfourth column. DocumenttoDocument Graph We build an undirected graph whose nodes denote documents in both DL and DU and edges...

7Update Summarization Based on CoRanking with Constraints2012  Xiaojun Wandocument set. Formally, let G=(SA, SB, EA, EB, EAB) be an undirected graph for the sentences in the two document sets DA and DB...

8PageRank on Semantic Networks, with Application to Word Sense Disambiguationrelations as edges. The graph can be constructed as an undirected graph, with no orientation defined for edges, or as a directed...

9Word Sense Disambiguation using a dictionary for sense similarity measureThe basic idea is to consider the dictionary as an undirected graph whose nodes are noun entries, and an edge exists between...

10Global topology of word cooccurrence networks: Beyond the tworegime powerlawis known as the adjacency matrix, is symmetric for an undirected graph and have binary entries for an unweighted graph. λ is...