|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM268252297 |
| 003 |
DE-627 |
| 005 |
20231224222317.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2017 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2016.2621671
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0894.xml
|
| 035 |
|
|
|a (DE-627)NLM268252297
|
| 035 |
|
|
|a (NLM)28113763
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Qingshan Liu
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Elastic Net Hypergraph Learning for Image Clustering and Semi-Supervised Classification
|
| 264 |
|
1 |
|c 2017
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 20.11.2019
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Graph model is emerging as a very effective tool for learning the complex structures and relationships hidden in data. In general, the critical purpose of graph-oriented learning algorithms is to construct an informative graph for image clustering and classification tasks. In addition to the classical K-nearest-neighbor and r-neighborhood methods for graph construction, l1-graph and its variants are emerging methods for finding the neighboring samples of a center datum, where the corresponding ingoing edge weights are simultaneously derived by the sparse reconstruction coefficients of the remaining samples. However, the pairwise links of l1-graph are not capable of capturing the high-order relationships between the center datum and its prominent data in sparse reconstruction. Meanwhile, from the perspective of variable selection, the l1 norm sparse constraint, regarded as a LASSO model, tends to select only one datum from a group of data that are highly correlated and ignore the others. To simultaneously cope with these drawbacks, we propose a new elastic net hypergraph learning model, which consists of two steps. In the first step, the robust matrix elastic net model is constructed to find the canonically related samples in a somewhat greedy way, achieving the grouping effect by adding the l2 penalty to the l1 constraint. In the second step, hypergraph is used to represent the high order relationships between each datum and its prominent samples by regarding them as a hyperedge. Subsequently, hypergraph Laplacian matrix is constructed for further analysis. New hypergraph learning algorithms, including unsupervised clustering and multi-class semi-supervised classification, are then derived. Extensive experiments on face and handwriting databases demonstrate the effectiveness of the proposed method
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Yubao Sun
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Cantian Wang
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Tongliang Liu
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Dacheng Tao
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 26(2017), 1 vom: 15. Jan., Seite 452-463
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:26
|g year:2017
|g number:1
|g day:15
|g month:01
|g pages:452-463
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2016.2621671
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 26
|j 2017
|e 1
|b 15
|c 01
|h 452-463
|