Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Palande, Sourabh"'
Autor:
Alvarado, Enrique G, Belton, Robin, Lee, Kang-Ju, Palande, Sourabh, Percival, Sarah, Purvine, Emilie, Tymochko, Sarah
The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a dataset $X$ and a graph $G$, does there exist a set of Mapper parameters s
Externí odkaz:
http://arxiv.org/abs/2408.11180
Autor:
Alvarado, Enrique, Belton, Robin, Fischer, Emily, Lee, Kang-Ju, Palande, Sourabh, Percival, Sarah, Purvine, Emilie
The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm requires tuning several parameters in order to generate a ``nice" Map
Externí odkaz:
http://arxiv.org/abs/2309.06634
Merge trees are a type of topological descriptors that record the connectivity among the sublevel sets of scalar fields. They are among the most widely used topological tools in visualization. In this paper, we are interested in sketching a set of me
Externí odkaz:
http://arxiv.org/abs/2101.03196
Deep neural networks such as GoogLeNet, ResNet, and BERT have achieved impressive performance in tasks such as image and text classification. To understand how such performance is achieved, we probe a trained deep neural network by studying neuron ac
Externí odkaz:
http://arxiv.org/abs/1912.06332
Autor:
Palande, Sourabh1 (AUTHOR), Kaste, Joshua A. M.2,3 (AUTHOR), Roberts, Miles D.3 (AUTHOR), Segura Abá, Kenia3 (AUTHOR), Claucherty, Carly4 (AUTHOR), Dacon, Jamell5 (AUTHOR), Doko, Rei5 (AUTHOR), Jayakody, Thilani B.4 (AUTHOR), Jeffery, Hannah R.4 (AUTHOR), Kelly, Nathan6 (AUTHOR), Manousidaki, Andriana7 (AUTHOR), Parks, Hannah M.2 (AUTHOR), Roggenkamp, Emily M.4 (AUTHOR), Schumacher, Ally M.3 (AUTHOR), Yang, Jiaxin1 (AUTHOR), Percival, Sarah2 (AUTHOR), Pardo, Jeremy3 (AUTHOR), Husbands, Aman Y.8 (AUTHOR), Krishnan, Arjun1,2 (AUTHOR), Montgomery, Beronda L2,9,10 (AUTHOR)
Publikováno v:
PLoS Biology. 12/5/2023, Vol. 21 Issue 12, p1-20. 20p.
As a generalization of the use of graphs to describe pairwise interactions, simplicial complexes can be used to model higher-order interactions between three or more objects in complex systems. There has been a recent surge in activity for the develo
Externí odkaz:
http://arxiv.org/abs/1708.08436
Autor:
Palande, Sourabh1 (AUTHOR), Arsenault, Jeremy2 (AUTHOR), Basurto‐Lozada, Patricia3 (AUTHOR), Bleich, Andrew4 (AUTHOR), Brown, Brianna N. I.4 (AUTHOR), Buysse, Sophia F.4,5,6 (AUTHOR), Connors, Noelle A.7 (AUTHOR), Das Adhikari, Sikta1,8 (AUTHOR), Dobson, Kara C.5,9 (AUTHOR), Guerra‐Castillo, Francisco Xavier10,11 (AUTHOR), Guerrero‐Carrillo, Maria F.12 (AUTHOR), Harlow, Sophia7 (AUTHOR), Herrera‐Orozco, Héctor13,14 (AUTHOR), Hightower, Asia T.4,5 (AUTHOR), Izquierdo, Paulo15 (AUTHOR), Jacobs, MacKenzie16,17 (AUTHOR), Johnson, Nicholas A.5,18 (AUTHOR), Leuenberger, Wendy5,9 (AUTHOR), Lopez‐Hernandez, Alessandro3,19 (AUTHOR), Luckie‐Duque, Alicia12 (AUTHOR)
Publikováno v:
Applications in Plant Sciences. Oct2024, p1. 13p. 4 Illustrations.
Autor:
Palande, Sourabh, Wang, Bei
As a generalization of the use of graphs to describe pairwise interactions, simplicial complexes can be used to model higher-order interactions between three or more objects in complex systems. There has been a recent surge in activity for the develo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb94c4858a94b96329c2e0fbb5792a04
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.