Confidence-aware graph regularization with heterogeneous pairwise features
Conventional classification methods tend to focus on features of individual objects, while missing out on potentially valuable pairwise features that capture the relationships between objects. Although recent developments on graph regularization exploit this aspect, existing works generally assume o...
Saved in:
Main Authors: | FANG, Yuan, HSU, Bo-June Paul, CHANG, Kevin Chen-Chuan |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2012
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4061 https://ink.library.smu.edu.sg/context/sis_research/article/5064/viewcontent/ConfGraphReg2012.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Mining progressive confident rules
by: Zhang, M., et al.
Published: (2013) -
Another construction of edge-regular graphs with regular cliques
by: Greaves, Gary Royden Watson, et al.
Published: (2020) -
Edge-regular graphs with regular cliques
by: Greaves, Gary Royden Watson, et al.
Published: (2019) -
On applications of the retracing method for distance-regular graphs
by: Vencer, Norma Luz C.
Published: (2006) -
Beyond triplet loss: Person re-identification with fine-grained difference-aware pairwise loss
by: YAN, Cheng, et al.
Published: (2022)