Fast Algorithm for the Lasso based L1-Graph Construction
Summary: Castnet speeds up lasso-based L1-graph construction by pruning edges unlikely to have nonzero weights and updating only active edges. This avoids updating all edges, enabling large-scale speedups while jointly computing adjacency and edge weights. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yasuhiro Fujiwara (Nippon Telegraph and Telephone; Nippon Telegraph and Telephone Communication Science Laboratories; Osaka University)
- 2. Yasutoshi Ida (Nippon Telegraph and Telephone)
- 3. Junya Arai (Nippon Telegraph and Telephone)
- 4. Mai Nishimura (Nippon Telegraph and Telephone)
- 5. Sotetsu Iwamura (Nippon Telegraph and Telephone)
BibTeX Citation
@article{fujiwara_vldb17,
title = {{Fast Algorithm for the Lasso based L1-Graph Construction}},
author = {Fujiwara, Yasuhiro and Ida, Yasutoshi and Arai, Junya and Nishimura, Mai and Iwamura, Sotetsu},
journal = {PVLDB},
series = {{VLDB} '17},
volume = {10},
number = {3},
pages = {229},
doi = {10.14778/3021924.3021938},
url = {https://doi.org/10.14778/3021924.3021938},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,508 | Efficient Algorithm for K-Multiple-Means | 2024 | SIGMOD | 4.9793485e-05 |
| 12,041 | Fast Algorithm for Anchor Graph Hashing | 2021 | VLDB | 4.9793485e-05 |
| 12,290 | Scaling Locally Linear Embedding | 2017 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,836 | SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs | 2015 | VLDB | 7.9547269e-05 |
| 6,611 | Madeus: Database Live Migration Middleware under Heavy Workloads for Cloud Environment | 2015 | SIGMOD | 5.7349419e-05 |
| 12,444 | Scaling Manifold Ranking Based Image Retrieval | 2015 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,064 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB |
| 2 | 10,827 | Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization | 2026 | VLDB |
| 3 | 5,422 | Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach | 2024 | VLDB |
| 4 | 1,169 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS |
| 5 | 1,187 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD |
| 6 | 11,265 | GraphSparseNet: a Novel Method for Large Scale Traffic Flow Prediction | 2025 | VLDB |
| 7 | 12,041 | Fast Algorithm for Anchor Graph Hashing | 2021 | VLDB |
| 8 | 1,860 | Efficient Ad-hoc Search for Personalized PageRank | 2013 | SIGMOD |
| 9 | 12,060 | Factorized Graph Representations for Semi-Supervised Learning from Sparse Data | 2020 | SIGMOD |
| 10 | 2,439 | Accelerating Large Scale Real-Time GNN Inference using Channel Pruning | 2021 | VLDB |