Outlier-resisting graph embedding

Yanwei Pang; Yuan Yuan

doi:10.1016/j.neucom.2009.08.020

Outlier-resisting graph embedding

Yanwei Pang
, Yuan Yuan

Tianjin University
Aston University

Research output: Contribution to journal › Article › peer-review

55 Scopus citations

Abstract

Graph embedding is a general framework for subspace learning. However, because of the well-known outlier-sensitiveness disadvantage of the L2-norm, conventional graph embedding is not robust to outliers which occur in many practical applications. In this paper, an improved graph embedding algorithm (termed LPP-L1) is proposed by replacing L2-norm with L1-norm. In addition to its robustness property, LPP-L1 avoids small sample size problem. Experimental results on both synthetic and real-world data demonstrate these advantages.

Original language	English
Pages (from-to)	968-974
Number of pages	7
Journal	Neurocomputing
Volume	73
Issue number	4-6
DOIs	https://doi.org/10.1016/j.neucom.2009.08.020
State	Published - Jan 2010
Externally published	Yes

Keywords

Dimensionality reduction
Graph embedding
L1-norm
Locality preserving projection
Outlier

Access to Document

10.1016/j.neucom.2009.08.020

Cite this

@article{985ae2ba97cc4fd79e0a3e368c36c7a2,

title = "Outlier-resisting graph embedding",

abstract = "Graph embedding is a general framework for subspace learning. However, because of the well-known outlier-sensitiveness disadvantage of the L2-norm, conventional graph embedding is not robust to outliers which occur in many practical applications. In this paper, an improved graph embedding algorithm (termed LPP-L1) is proposed by replacing L2-norm with L1-norm. In addition to its robustness property, LPP-L1 avoids small sample size problem. Experimental results on both synthetic and real-world data demonstrate these advantages.",

keywords = "Dimensionality reduction, Graph embedding, L1-norm, Locality preserving projection, Outlier",

author = "Yanwei Pang and Yuan Yuan",

year = "2010",

month = jan,

doi = "10.1016/j.neucom.2009.08.020",

language = "英语",

volume = "73",

pages = "968--974",

journal = "Neurocomputing",

issn = "0925-2312",

publisher = "Elsevier B.V.",

number = "4-6",

}

TY - JOUR

T1 - Outlier-resisting graph embedding

AU - Pang, Yanwei

AU - Yuan, Yuan

PY - 2010/1

Y1 - 2010/1

N2 - Graph embedding is a general framework for subspace learning. However, because of the well-known outlier-sensitiveness disadvantage of the L2-norm, conventional graph embedding is not robust to outliers which occur in many practical applications. In this paper, an improved graph embedding algorithm (termed LPP-L1) is proposed by replacing L2-norm with L1-norm. In addition to its robustness property, LPP-L1 avoids small sample size problem. Experimental results on both synthetic and real-world data demonstrate these advantages.

AB - Graph embedding is a general framework for subspace learning. However, because of the well-known outlier-sensitiveness disadvantage of the L2-norm, conventional graph embedding is not robust to outliers which occur in many practical applications. In this paper, an improved graph embedding algorithm (termed LPP-L1) is proposed by replacing L2-norm with L1-norm. In addition to its robustness property, LPP-L1 avoids small sample size problem. Experimental results on both synthetic and real-world data demonstrate these advantages.

KW - Dimensionality reduction

KW - Graph embedding

KW - L1-norm

KW - Locality preserving projection

KW - Outlier

UR - https://www.scopus.com/pages/publications/75749094310

U2 - 10.1016/j.neucom.2009.08.020

DO - 10.1016/j.neucom.2009.08.020

M3 - 文章

AN - SCOPUS:75749094310

SN - 0925-2312

VL - 73

SP - 968

EP - 974

JO - Neurocomputing

JF - Neurocomputing

IS - 4-6

ER -

Outlier-resisting graph embedding

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this