Beyond rankings: comparing directed acyclic graphs
From MaRDI portal
Publication:1715891
DOI10.1007/s10618-015-0406-1zbMath1405.68096OpenAlexW2155394090MaRDI QIDQ1715891
Nikolaj Tatti, Eric Malmi, Aristides Gionis
Publication date: 29 January 2019
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-015-0406-1
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General topics in the theory of data (68P01)
Related Items (2)
A new interpretation and derivation of the Swaps index ⋮ Ensemble framework for causality learning with heterogeneous directed acyclic graphs through the lens of optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hardness of approximating minimum vertex cover
- Mixtures of distance-based models for ranking data
- Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
- Approximating minimum feedback sets and multicuts in directed graphs
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Comparing and Aggregating Partial Orders with Kendall Tau Distances
- A graph distance metric based on the maximal common subgraph
- Comparing Top k Lists
- A New Approach to Incremental Cycle Detection and Related Problems
- Reducibility among Combinatorial Problems
- On the approximability of the maximum common subgraph problem
- Measures of Association for Cross Classifications, IV: Simplification of Asymptotic Variances
- Comparing Partial Rankings
- A NEW MEASURE OF RANK CORRELATION
- Aggregating inconsistent information
This page was built for publication: Beyond rankings: comparing directed acyclic graphs
