|
|
|
|
| LEADER |
01000caa a22002652 4500 |
| 001 |
NLM296789062 |
| 003 |
DE-627 |
| 005 |
20240330232338.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2020 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2019.2914651
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1356.xml
|
| 035 |
|
|
|a (DE-627)NLM296789062
|
| 035 |
|
|
|a (NLM)31059426
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Sussman, Daniel L
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Matched Filters for Noisy Induced Subgraph Detection
|
| 264 |
|
1 |
|c 2020
|
| 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 Completed 16.07.2021
|
| 500 |
|
|
|a Date Revised 30.03.2024
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision. We propose a solution to this problem via a graph matching matched filter: centering and padding the smaller adjacency matrix and applying graph matching methods to align it to the larger network. The centering and padding schemes can be incorporated into any algorithm that matches using adjacency matrices. Under a statistical model for correlated pairs of graphs, which yields a noisy copy of the small graph within the larger graph, the resulting optimization problem can be guaranteed to recover the true vertex correspondence between the networks. However, there are currently no efficient algorithms for solving this problem. To illustrate the possibilities and challenges of such problems, we use an algorithm that can exploit a partially known correspondence and show via varied simulations and applications to Drosophila and human connectomes that this approach can achieve good performance
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, N.I.H., Extramural
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 650 |
|
4 |
|a Research Support, U.S. Gov't, Non-P.H.S.
|
| 700 |
1 |
|
|a Park, Youngser
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Priebe, Carey E
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Lyzinski, Vince
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 42(2020), 11 vom: 21. Nov., Seite 2887-2900
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:42
|g year:2020
|g number:11
|g day:21
|g month:11
|g pages:2887-2900
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2019.2914651
|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 42
|j 2020
|e 11
|b 21
|c 11
|h 2887-2900
|