The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections (English)
- New search for: Gnecco, Lucas
- New search for: Boria, Nicolas
- New search for: Bougleux, Sebastien
- New search for: Yzer, Florian
- New search for: Blumenthal, David B.
- New search for: Gnecco, Lucas
- New search for: Boria, Nicolas
- New search for: Bougleux, Sebastien
- New search for: Yzer, Florian
- New search for: Blumenthal, David B.
In:
Similarity Search and Applications
; 337-351
;
2021
-
ISBN:
- Conference paper / Print
-
Title:The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections
-
Contributors:Gnecco, Lucas ( author ) / Boria, Nicolas ( author ) / Bougleux, Sebastien ( author ) / Yzer, Florian ( author ) / Blumenthal, David B. ( author )
-
Conference:SISAP ; 14. ; 2021 ; Online
-
Published in:Similarity Search and Applications ; 337-351
-
Publisher:
- New search for: Springer
-
Place of publication:Cham
-
Publication date:2021
-
ISBN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
- New search for: 54.80 / 54.62
- Further information on Basic classification
-
Keywords:
-
Classification:
-
Source:
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 3
-
Organizing Similarity Spaces Using Metric HullsJánošová, Miriama / Procházka, David / Dohnal, Vlastislav et al. | 2021
- 17
-
Scaling Up Set Similarity Joins Using a Cost-Based Distributed-Paralle FrameworkFier, Fabian / Freytag, Johann-Christoph et al. | 2021
- 32
-
A Triangle Inequality for Cosine SimilaritySchubert, Erich et al. | 2021
- 45
-
A Cost Model for Reverse Nearest Neighbor Query Processing on R-Trees Using Self PruningBorutta, Felix / Kröger, Peer / Renz, Matthias et al. | 2021
- 54
-
How Many Neighbours for Known-Item Search?Lokoč, Jakub / Souček, Tomas et al. | 2021
- 66
-
On Generalizing Permutation-Based Representations for Approximate SearchVadicamo, Lucia / Gennaro, Claudio / Amato, Giuseppe et al. | 2021
- 81
-
Data-Driven Learned Metric Index: An Unsupervised ApproachSlanináková, Terézia / Antol, Matej / Olha, Jaroslav / Kaňa, Vojtěch / Dohnal, Vlastislav et al. | 2021
- 95
-
Towards a Learned Index Structure for Approximate Nearest Neighbor Search Query ProcessingHünemörder, Maximilian / Kröger, Peer / Renz, Matthias et al. | 2021
- 104
-
Similarity vs. Relevance: From Simple Searches to Complex DiscoverySkopal, Tomáš / Bernhauer, David / Škoda, Petr / Klímek, Jakub / Nečasky, Martin et al. | 2021
- 118
-
Non-parametric Semi-supervised Learning by Bayesian Label Distribution PropagationGottcke, Jonatan Mgaller Nuutinen / Zimek, Arthur / Campello, Ricardo J. G. B. et al. | 2021
- 133
-
Optimizing Fair Approximate Nearest Neighbor Searches Using Threaded B+ TreesJafari, Omid / Maurya, Preeti / Islam, Khandker Mushfiqul / Nagarkar, Parth et al. | 2021
- 148
-
Fairest Neighbors: Tradeoffs Between Metric QueriesHetland, Magnus Lie / Hummel, Halvard et al. | 2021
- 159
-
Local Intrinsic Dimensionality and Graphs: Towards LID-aware Graph Embedding AlgorithmsSavic, Miloš / Kurbalija, Vladimir / Radovanovic, Miloš et al. | 2021
- 173
-
Structural Intrinsic DimensionalityMarchand-Maillet, Stephane / Pedreira, Oscar / Chávez, Edgar et al. | 2021
- 186
-
Relationships Between Local Intrinsic Dimensionality and Tail EntropyBailey, James / Houle, Michael E. / Ma, Xingjun et al. | 2021
- 201
-
The Effect of Random Projection on Local Intrinsic DimensionalityHoule, Michael E. / Kawarabayashi, Ken-ichi et al. | 2021
- 217
-
Accelerating Spherical k-MeansSchubert, Erich / Lang, Andreas / Feher, Gloria et al. | 2021
- 232
-
MESS: Manifold Embedding Motivated Super SamplingThordsen, Erik / Schubert, Erich et al. | 2021
- 247
-
Handling Class Imbalance in k-Nearest Neighbor Classification by Balancing Prior ProbabilitiesGøttcke, Jonatan Møller Nuutinen / Zimek, Arthur et al. | 2021
- 265
-
Similarity Search for an Extreme Application: Experience and ImplementationKřenek, Vladimir Mic. Tomás Raček. Alesš / Zezula, Pavel et al. | 2021
- 280
-
What Makes a Good Movie Recommendation? Feature Selection for Content-Based FilteringGawinecki, Maciej / Szmyd, Wojciech / Zuchowicz, Urszula / Walas, Marcin et al. | 2021
- 295
-
Indexed Polygon Matching Under SimilaritiesLuque-Suarez, Fernando / López-López, J. L. / Chavez, Edgar et al. | 2021
- 307
-
Clustering Adverse Events of COVID-19 Vaccines Across the United StatesAskar, Ahmed / Züfle, Andreas et al. | 2021
- 323
-
Metric Indexing for Graph Similarity SearchBause, Franka / Blumenthal, David B. / Schubert, Erich / Kriege, Nils M. et al. | 2021
- 337
-
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph CollectionsGnecco, Lucas / Boria, Nicolas / Bougleux, Sebastien / Yzer, Florian / Blumenthal, David B. et al. | 2021
- 352
-
Graph Embedding in Vector Spaces Using Matching-traphsFuchs, Mathias / Riesen, Kaspar et al. | 2021
- 364
-
An A*-algorithm for the Unordered Tree Edit Distance wıth Custom CostsPaaßen, Benjamin et al. | 2021
- 372
-
FIMSIM: Discovering Communities by Frequent Item-Set Mining and Similarity SearchPeschel, Jakub / Batko, Michal / Valcik, Jakub / Sedmidubsky, Jan / Zezula, Pavel et al. | 2021
- 387
-
Towards an Italian Healthcare Knowledge GraphPostiglione, Marco et al. | 2021
- 395
-
Progressive Query-Driven Entity ResotatiunZecchini, Luca et al. | 2021
- 402
-
Discovering Latent Information from Noisy Sources in the Cultural Heritage DomainScarrone, Fabrizio et al. | 2021