From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Optimizing the Induced Correlation in Omnibus Joint Graph Embeddings., , , , и . CoRR, (2024)Laplacian Eigenmaps From Sparse, Noisy Similarity Measurements., и . IEEE Trans. Signal Process., 65 (8): 1988-2003 (2017)An evaluation of graph clustering methods for unsupervised term discovery., , и . INTERSPEECH, стр. 3209-3213. ISCA, (2015)On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching., , , и . J. Mach. Learn. Res., (2016)Graph Matching Between Bipartite and Unipartite Networks: To Collapse, or Not to Collapse, That Is the Question., , и . IEEE Trans. Netw. Sci. Eng., 8 (4): 3019-3033 (2021)Adversarial contamination of networks in the setting of vertex nomination: a new trimming method., , и . CoRR, (2022)Vertex Nomination, Consistent Estimation, and Adversarial Modification., , , , , и . CoRR, (2019)A Central Limit Theorem for an Omnibus Embedding of Multiple Random Dot Product Graphs., , , , и . ICDM Workshops, стр. 964-967. IEEE Computer Society, (2017)Statistical Inference on Random Dot Product Graphs: a Survey., , , , , , , , , и . J. Mach. Learn. Res., (2017)Gotta Match 'Em All: Solution Diversification in Graph Matching Matched Filters., , , , и . IEEE Trans. Signal Inf. Process. over Networks, (2024)