Span-core Decomposition for Temporal Networks: Algorithms and Applications | 0 | 0.34 | 2021 |
Correlation Clustering with Global Weight Bounds | 0 | 0.34 | 2021 |
Garnlp: A Natural Language Processing Pipeline For Garnishment Documents | 0 | 0.34 | 2021 |
Advancing Receivable Financing via a Network-based Approach | 0 | 0.34 | 2021 |
Mining Data for Financial Applications - 4th ECML PKDD Workshop, MIDAS 2019, Würzburg, Germany, September 16, 2019, Revised Selected Papers | 0 | 0.34 | 2020 |
In and Out: Optimizing Overall Interaction in Probabilistic Graphs under Clustering Constraints | 0 | 0.34 | 2020 |
Improving News Personalization Through Search Logs. | 0 | 0.34 | 2020 |
The importance of unexpectedness: Discovering buzzing stories in anomalous temporal graphs. | 1 | 0.34 | 2019 |
ECML PKDD 2018 Workshops - MIDAS 2018 and PAP 2018, Dublin, Ireland, September 10-14, 2018, Proceedings | 0 | 0.34 | 2019 |
Mining (maximal) span-cores from temporal networks. | 7 | 0.39 | 2018 |
Network-based Receivable Financing. | 0 | 0.34 | 2018 |
Probabilistic Causal Analysis of Social Influence. | 1 | 0.35 | 2018 |
Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications | 2 | 0.35 | 2018 |
Conditional Reliability in Uncertain Graphs. | 3 | 0.41 | 2018 |
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem. | 5 | 0.39 | 2017 |
Core Decomposition and Densest Subgraph in Multilayer Networks. | 7 | 0.39 | 2017 |
An information-theoretic approach to hierarchical clustering of uncertain data. | 3 | 0.38 | 2017 |
Exploiting search history of users for news personalization. | 6 | 0.41 | 2017 |
HERMEVENT: a news collection for emerging-event detection | 0 | 0.34 | 2017 |
The Projective Clustering Ensemble Problem for Advanced Data Clustering. | 0 | 0.34 | 2017 |
Ensemble-based community detection in multilayer networks. | 4 | 0.39 | 2017 |
Advancing Nlp Via A Distributed-Messaging Approach | 1 | 0.35 | 2016 |
Graph-Based Breaking News Detection on Wikipedia. | 1 | 0.35 | 2016 |
Hermes: A Distributed-Messaging Tool for NLP. | 0 | 0.34 | 2016 |
Identifying Buzzing Stories via Anomalous Temporal Subgraph Discovery | 2 | 0.35 | 2016 |
Handling Uncertainty in Clustering Art-Exhibition Visiting Styles | 0 | 0.34 | 2016 |
MultiClust 2013: Multiple Clusterings, Multiview Data, and Multisource Knowledgedriven Clustering: [Workshop Report]. | 0 | 0.34 | 2016 |
Metacluster-based Projective Clustering Ensembles | 3 | 0.36 | 2015 |
DifRec: A Social-Diffusion-Aware Recommender System | 1 | 0.36 | 2015 |
Graph Query Reformulation with Diversity | 12 | 0.52 | 2015 |
Finding Subgraphs with Maximum Total Density and Limited Overlap | 28 | 0.78 | 2015 |
The Minimum Wiener Connector Problem | 8 | 0.43 | 2015 |
Top-k Reliable Edge Colors in Uncertain Graphs | 1 | 0.36 | 2015 |
Efficient and effective community search | 29 | 0.72 | 2015 |
The Minimum Wiener Connector. | 2 | 0.35 | 2015 |
Uncertain Graph Processing through Representative Instances | 6 | 0.46 | 2015 |
The pursuit of a good possible world: extracting representative instances of uncertain graphs | 11 | 0.57 | 2014 |
Distance oracles in edge-labeled graphs. | 9 | 0.55 | 2014 |
Fast Reliability Search in Uncertain Graphs. | 15 | 0.55 | 2014 |
Core decomposition of uncertain graphs | 38 | 1.01 | 2014 |
Be Certain of How-to before Mining Uncertain Data. | 0 | 0.34 | 2014 |
Minimizing the Variance of Cluster Mixture Models for Clustering Uncertain Objects | 8 | 0.57 | 2013 |
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees | 102 | 2.58 | 2013 |
A Tensor-based Clustering Approach for Multiple Document Classifications. | 1 | 0.35 | 2013 |
Projective clustering ensembles | 3 | 0.38 | 2013 |
Mining Summaries of Propagations | 5 | 0.49 | 2013 |
Uncertain centroid based partitional clustering of uncertain data | 11 | 0.59 | 2012 |
Chromatic correlation clustering. | 1 | 0.36 | 2012 |
Uncertain Centroid based Partitional Clustering of Uncertain Data. | 0 | 0.34 | 2012 |
Multiobjective optimization of co-clustering ensembles | 2 | 0.37 | 2012 |