All Stories

  1. Explainable Anomaly Detection in Dynamic Heterogeneous Graphs via Relation Evolution
  2. Mamba Hawkes Process for Event Sequence Modeling
  3. Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC
  4. Corrigendum: Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study: [Experiments & Analysis]
  5. Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
  6. Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study
  7. STORM: Spatio-Temporal Similar Trajectory Retrieval on Non-Uniform Maritime Data
  8. TempASD: Temporal Anomalous Subgraph Discovery in Large-Scale Dynamic Financial Networks
  9. UnG-MoCha: Neural Motif Counting in Uncertain Graphs
  10. MoDiff - Graph Generation with Motif-aware Diffusion Model
  11. UTCS: Effective Unsupervised Temporal Community Search with Pre-training of Temporal Dynamics and Subgraph Knowledge
  12. SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search
  13. Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs
  14. Similarity and Diversity: PCA-Based Contribution Evaluation in Federated Learning
  15. Efficient Structural Clustering Over Hypergraphs
  16. ReadGraph: Relational Evolution Enhanced Anomaly Detection in Dynamic Heterogeneous Graph
  17. CSPO: Cross-Market Synergistic Stock Price Movement Forecasting with Pseudo-volatility Optimization
  18. TRACE: Intra-visit Clinical Event Nowcasting via Effective Patient Trajectory Encoding
  19. Hypergraph-Enhanced Multi-Granularity Stochastic Weight Completion in Sparse Road Networks
  20. Reproducibility Report for ACM SIGMOD 2024 Paper: 'Temporal JSON Keyword Search'
  21. Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs
  22. Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-Aware Index
  23. Towards Effective Top-N Hamming Search via Bipartite Graph Contrastive Hashing
  24. In-Depth Analysis of Densest Subgraph Discovery in a Unified Framework
  25. FDM: Effective and efficient incident detection on sparse trajectory data
  26. Machine learning model improves job mobility predictions by studying market connections
  27. Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
  28. Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks
  29. Distributed Shortest Distance Labeling on Large-Scale Graphs
  30. On Efficient Large Sparse Matrix Chain Multiplication
  31. A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery
  32. A Similarity-based Approach for Efficient Large Quasi-clique Detection
  33. Efficient Core Decomposition Over Large Heterogeneous Information Networks
  34. Efficient and effective algorithms for densest subgraph discovery and maintenance
  35. Influential Exemplar Replay for Incremental Learning in Recommender Systems
  36. Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs
  37. Before Generation, Align it! A Novel and Effective Strategy for Mitigating Hallucinations in Text-to-SQL Generation
  38. TRoute: Dynamic Time-Dependent Route Recommendation on Road Networks
  39. MOSER: Scalable Network Motif Discovery Using Serial Test
  40. Accelerating directed densest subgraph queries with software and hardware approaches
  41. Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery
  42. On Querying Connected Components in Large Temporal Graphs
  43. Scalable Algorithms for Densest Subgraph Discovery
  44. Fdm: Effective and Efficient Incident Detection on Sparse Trajectory Data
  45. Densest subgraph discovery on large graphs
  46. Towards Passive, Migration-Free, Standardized, Long-Term Database Archival
  47. Effective community search over large star-schema heterogeneous information networks
  48. Finding locally densest subgraphs
  49. A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery
  50. DeepTEA
  51. On Directed Densest Subgraph Discovery
  52. Efficient Directed Densest Subgraph Discovery
  53. On analyzing graphs with motif-paths
  54. Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs
  55. LINC