All Stories

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