default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMinh Tang
Person information
- affiliation: Johns Hopkins University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Yichi Zhang
, Minh Tang:
A Theoretical Analysis of DeepWalk and Node2vec for Exact Recovery of Community Structures in Stochastic Blockmodels. IEEE Trans. Pattern Anal. Mach. Intell. 46(2): 1065-1078 (2024)- [i13]Yin-Jen Chen, Minh Tang:
Regression for matrix-valued data via Kronecker products factorization. CoRR abs/2404.19220 (2024) - 2023
- [j17]John Koo, Minh Tang, Michael W. Trosset:
Popularity Adjusted Block Models are Generalized Random Dot Product Graphs. J. Comput. Graph. Stat. 32(1): 131-144 (2023) - [j16]Avanti Athreya, Zachary Lubberts, Carey E. Priebe, Youngser Park, Minh Tang, Vince Lyzinski, Michael J. Kane, Bryan Lewis:
Numerical Tolerance for Spectral Decompositions of Random Matrices and Applications to Network Inference. J. Comput. Graph. Stat. 32(1): 145-156 (2023) - [c7]Khuzaima Hameed, Rob Johnston, Brent Younce, Minh Tang, Alyson G. Wilson:
Motif-Based Exploratory Data Analysis for State-Backed Platform Manipulation on Twitter. ICWSM 2023: 315-326 - 2022
- [j15]Runbing Zheng, Vince Lyzinski, Carey E. Priebe, Minh Tang:
Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming. J. Comput. Graph. Stat. 31(4): 1254-1268 (2022) - [i12]Yichi Zhang, Minh Tang:
Perturbation Analysis of Randomized SVD and its Applications to High-dimensional Statistics. CoRR abs/2203.10262 (2022) - [i11]Sheyda Peyman, Minh Tang, Vince Lyzinski:
Adversarial contamination of networks in the setting of vertex nomination: a new trimming method. CoRR abs/2208.09710 (2022) - 2021
- [j14]Keith D. Levin, Fred Roosta, Minh Tang, Michael W. Mahoney, Carey E. Priebe:
Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings. J. Mach. Learn. Res. 22: 194:1-194:59 (2021) - [i10]Yichi Zhang, Minh Tang:
Consistency of random-walk based network embedding algorithms. CoRR abs/2101.07354 (2021) - [i9]John Koo, Minh Tang, Michael W. Trosset:
Popularity Adjusted Block Models are Generalized Random Dot Product Graphs. CoRR abs/2109.04010 (2021) - [i8]Yin-Jen Chen, Minh Tang:
Classification of high-dimensional data with spiked covariance matrix structure. CoRR abs/2110.01950 (2021) - 2020
- [i7]Michael W. Trosset, Mingyue Gao, Minh Tang, Carey E. Priebe:
Learning 1-Dimensional Submanifolds for Subsequent Inference on Random Dot Product Graphs. CoRR abs/2004.07348 (2020) - [i6]Runbing Zheng, Vince Lyzinski, Carey E. Priebe, Minh Tang:
Vertex nomination between graphs via spectral embedding and quadratic programming. CoRR abs/2010.14622 (2020)
2010 – 2019
- 2019
- [j13]Joshua Cape, Minh Tang, Carey E. Priebe:
On spectral embedding performance and elucidating network structure in stochastic blockmodel graphs. Netw. Sci. 7(3): 269-291 (2019) - [i5]Keith D. Levin, Fred Roosta, Minh Tang, Michael W. Mahoney, Carey E. Priebe:
Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings. CoRR abs/1910.00423 (2019) - 2018
- [i4]Minh Tang:
The eigenvalues of stochastic blockmodel graphs. CoRR abs/1803.11551 (2018) - [i3]Carey E. Priebe, Youngser Park, Joshua T. Vogelstein, John M. Conroy, Vince Lyzinski, Minh Tang, Avanti Athreya, Joshua Cape, Eric Bridgeford:
On a 'Two Truths' Phenomenon in Spectral Graph Clustering. CoRR abs/1808.07801 (2018) - 2017
- [j12]Avanti Athreya, Donniell E. Fishkind, Minh Tang, Carey E. Priebe, Youngser Park, Joshua T. Vogelstein, Keith D. Levin, Vince Lyzinski, Yichen Qin, Daniel L. Sussman:
Statistical Inference on Random Dot Product Graphs: a Survey. J. Mach. Learn. Res. 18: 226:1-226:92 (2017) - [j11]Vince Lyzinski, Minh Tang, Avanti Athreya, Youngser Park, Carey E. Priebe:
Community Detection and Classification in Hierarchical Stochastic Blockmodels. IEEE Trans. Netw. Sci. Eng. 4(1): 13-26 (2017) - [c6]Keith D. Levin, Avanti Athreya, Minh Tang, Vince Lyzinski, Carey E. Priebe:
A Central Limit Theorem for an Omnibus Embedding of Multiple Random Dot Product Graphs. ICDM Workshops 2017: 964-967 - [i2]Patrick Rubin-Delanchy, Carey E. Priebe, Minh Tang, Joshua Cape:
A statistical interpretation of spectral embedding: the generalised random dot product graph. CoRR abs/1709.05506 (2017) - 2016
- [j10]Amol Dattatraya Mali, Minh Tang:
Path-Cost Bounds for Parameterized Centralized Variants of A* for Static and Certain Environments. Int. J. Artif. Intell. Tools 25(4): 1650028:1-1650028:18 (2016) - 2014
- [j9]Cencheng Shen, Ming Sun, Minh Tang, Carey E. Priebe:
Generalized canonical correlation analysis for classification. J. Multivar. Anal. 130: 310-322 (2014) - [j8]Daniel L. Sussman, Minh Tang, Carey E. Priebe:
Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 36(1): 48-57 (2014) - [j7]Heng Wang, Minh Tang, Youngser Park, Carey E. Priebe:
Locality Statistics for Anomaly Detection in Time Series of Graphs. IEEE Trans. Signal Process. 62(3): 703-717 (2014) - 2013
- [j6]Nam H. Lee, Jordan Yoder, Minh Tang, Carey E. Priebe:
On Latent Position Inference from Doubly Stochastic Messaging Activities. Multiscale Model. Simul. 11(3): 683-718 (2013) - [j5]Ming Sun, Carey E. Priebe, Minh Tang:
Generalized canonical correlation analysis for disparate data fusion. Pattern Recognit. Lett. 34(2): 194-200 (2013) - [j4]Donniell E. Fishkind, Daniel L. Sussman, Minh Tang, Joshua T. Vogelstein, Carey E. Priebe:
Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown. SIAM J. Matrix Anal. Appl. 34(1): 23-39 (2013) - [j3]Minh Tang, Youngser Park, Nam H. Lee, Carey E. Priebe:
Attribute Fusion in a Latent Process Model for Time Series of Graphs. IEEE Trans. Signal Process. 61(7): 1721-1732 (2013) - [c5]Heng Wang, Minh Tang, Carey E. Priebe, Youngser Park:
Inference in time series of graphs using locality statistics. GlobalSIP 2013: 471-474 - [c4]Jianqiao Feng, Xiaoying Tang, Minh Tang, Carey E. Priebe, Michael I. Miller:
Metric Space Structures for Computational Anatomy. MLMI 2013: 123-130 - 2012
- [c3]Ming Sun, Minh Tang, Carey E. Priebe:
A Comparison of Graph Embedding Methods for Vertex Nomination. ICMLA (1) 2012: 398-403 - [i1]Ming Sun, Carey E. Priebe, Minh Tang:
Generalized Canonical Correlation Analysis for Disparate Data Fusion. CoRR abs/1209.3761 (2012)
2000 – 2009
- 2007
- [j2]Minh Tang:
Generating Functions and the Solutions of Full History Recurrence Equations. Electron. Notes Discret. Math. 29: 445-449 (2007) - 2006
- [j1]Amol Dattatraya Mali, Minh Tang:
State-space Planning with Variants of A*. Int. J. Artif. Intell. Tools 15(3): 433-464 (2006) - 2004
- [c2]Minh Tang, Amol Dattatraya Mali:
Variants of A* for Planning. ECAI 2004: 1093-1094 - 2003
- [c1]Minh Tang, Amol Dattatraya Mali:
Search Control Techniques for Planning. ICTAI 2003: 168-175
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
