✦ LIBER ✦

Discriminative Graph Embedding for Label Propagation

✍ Scribed by Canh Hao Nguyen; Mamitsuka, H.

Book ID: 118040563
Publisher: IEEE
Year: 2011
Tongue: English
Weight: 455 KB
Volume: 22
Category: Article
ISSN: 1045-9227
DOI: 10.1109/tnn.2011.2160873

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Discriminative prototype selection metho

Discriminative prototype selection methods for graph embedding

✍ Zare Borzeshi, Ehsan; Piccardi, Massimo; Riesen, Kaspar; Bunke, Horst 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 635 KB

Combining labeled and unlabeled data wit

Combining labeled and unlabeled data with graph embedding

✍ Haitao Zhao 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 165 KB

Semi-supervised orthogonal discriminant

Semi-supervised orthogonal discriminant analysis via label propagation

✍ Feiping Nie; Shiming Xiang; Yangqing Jia; Changshui Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 555 KB

Discriminant neighborhood embedding for

Discriminant neighborhood embedding for classification

✍ Wei Zhang; Xiangyang Xue; Hong Lu; Yue-Fei Guo 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 264 KB

Efficient Constraint Propagation for Gra

Efficient Constraint Propagation for Graph Coloring

✍ Frédéric Boussemart; Fred Hemery; Christophe Lecoutre; Mouny Samy Modeliar 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 283 KB

A duality theorem for graph embeddings

✍ Brad Jackson; T. D. Parsons; Tomaž Pisanski 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 918 KB

## Abstract A generalized type of graph covering, called a “Wrapped quasicovering” (wqc) is defined. If __K, L__ are graphs dually embedded in an orientable surface __S__, then we may lift these embeddings to embeddings of dual graphs K̃,L̃ in orientable surfaces S̃, such that S̃ are branched cover