Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Nate Veldt"'
Publikováno v:
SIAM Review. 64:650-685
The minimum $s$-$t$ cut problem in graphs is one of the most fundamental problems in combinatorial optimization, and graph cuts underlie algorithms throughout discrete mathematics, theoretical computer science, operations research, and data science.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::532a83692200521c276aa1109010eb62
https://doi.org/10.1137/20m1321048
https://doi.org/10.1137/20m1321048
Publikováno v:
Proceedings of the International AAAI Conference on Web and Social Media. 16:1208-1217
A collection of over 3000 pages of emails sent by Anthony Fauci and his staff were released in an effort to understand the United States government response to the COVID-19 pandemic. In this paper, we describe how the original PDF document of emails
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03a4f4ed1830b0b45bfd6eb9a5137ef6
https://doi.org/10.1609/icwsm.v16i1.19371
https://doi.org/10.1609/icwsm.v16i1.19371
Publikováno v:
Science advances. 9(1)
Homophily is the seemingly ubiquitous tendency for people to connect and interact with other individuals who are similar to them. This is a well-documented principle and is fundamental for how society organizes. Although many social interactions occu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e4d056480231464936faba53e48a14e
https://pubmed.ncbi.nlm.nih.gov/36608141
https://pubmed.ncbi.nlm.nih.gov/36608141
Autor:
Nate Veldt
Hypergraph clustering is a basic algorithmic primitive for analyzing complex datasets and systems characterized by multiway interactions, such as group email conversations, groups of co-purchased retail products, and co-authorship data. This paper pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ee39ea37cf1236ee86b51bf83c78dc7
Autor:
Sinan G. Aksoy, Ryan Bennink, Yuzhou Chen, José Frías, Yulia R. Gel, Bill Kay, Uwe Naumann, Carlos Ortiz Marrero, Anthony V. Petyuk, Sandip Roy, Ignacio Segovia-Dominguez, Nate Veldt, Stephen J. Young
We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ee383a44567fb1bd8fb59f3abec14ee
Publikováno v:
KDD
Finding dense subgraphs of a large graph is a standard problem in graph mining that has been studied extensively both for its theoretical richness and its many practical applications. In this paper we introduce a new family of dense subgraph objectiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f50b72da51945a98a3edf1a9d146cc5
https://doi.org/10.1145/3447548.3467398
https://doi.org/10.1145/3447548.3467398
Hypergraphs are a natural modeling paradigm for a wide range of complex relational systems. A standard analysis task is to identify clusters of closely related or densely interconnected nodes. Many graph algorithms for this task are based on variants
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d42d2d0603844b9e10e0695b33ca400a
http://arxiv.org/abs/2101.09611
http://arxiv.org/abs/2101.09611
Publikováno v:
WWW
Hypergraph-based machine learning methods are now widely recognized as important for modeling and using higher-order and multiway relationships between data objects. Local hypergraph clustering and semi-supervised learning specifically involve findin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32142729c7dc72d33ae5fab0b536c800
http://arxiv.org/abs/2011.07752
http://arxiv.org/abs/2011.07752
Publikováno v:
KDD
Hypergraphs are a useful abstraction for modeling multiway relationships in data, and hypergraph clustering is the task of detecting groups of closely related nodes in such data. Graph clustering has been studied extensively, and there are numerous m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42e6eebbc13f889a532f343602928ff9
https://doi.org/10.1145/3394486.3403222
https://doi.org/10.1145/3394486.3403222