{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:47:15Z","timestamp":1777675635304,"version":"3.51.4"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:p>\n            The lasso-based L\n            <jats:sub>1<\/jats:sub>\n            -graph is used in many applications since it can effectively model a set of data points as a graph. The lasso is a popular regression approach and the L\n            <jats:sub>1<\/jats:sub>\n            -graph represents data points as nodes by using the regression result. More specifically, by solving the L\n            <jats:sub>1<\/jats:sub>\n            -optimization problem of the lasso, the sparse regression coefficients are used to obtain the weights of the edges in the graph. Conventional graph structures such as\n            <jats:italic>k<\/jats:italic>\n            -NN graph use two steps, adjacency searching and weight selection, for constructing the graph whereas the lasso-based L\n            <jats:sub>1<\/jats:sub>\n            -graph derives the adjacency structure as well as the edge weights simultaneously by using a coordinate descent. However, the construction cost of the lasso-based L\n            <jats:sub>1<\/jats:sub>\n            -graph is impractical for large data sets since the coordinate descent iteratively updates the weights of all edges until convergence. Our proposal,\n            <jats:italic>Castnet,<\/jats:italic>\n            can efficiently construct the lasso-based L\n            <jats:sub>1<\/jats:sub>\n            -graph. In order to avoid updating the weights of all edges, we prune edges that cannot have nonzero weights before entering the iterations. In addition, we update edge weights only if they are nonzero in the iterations. Experiments show that Castnet is significantly faster than existing approaches.\n          <\/jats:p>","DOI":"10.14778\/3021924.3021938","type":"journal-article","created":{"date-parts":[[2017,1,24]],"date-time":"2017-01-24T15:29:41Z","timestamp":1485271781000},"page":"229-240","source":"Crossref","is-referenced-by-count":10,"title":["Fast algorithm for the lasso based L\n            <sub>1<\/sub>\n            -graph construction"],"prefix":"10.14778","volume":"10","author":[{"given":"Yasuhiro","family":"Fujiwara","sequence":"first","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan and NTT Communication Science Laboratories, Seika-Cho Soraku-gun, Kyoto, Japan and Osaka University, Osaka, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasutoshi","family":"Ida","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junya","family":"Arai","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mai","family":"Nishimura","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sotetsu","family":"Iwamura","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,11]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"1027","volume-title":"SODA","author":"Arthur D.","year":"2007"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2038764"},{"key":"e_1_2_1_3_1","volume-title":"Visual Categorization with Bags of Keypoints. In ECCV International Workshop on Statistical Learning in Computer Vision","author":"Dance C.","year":"2004"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206547"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS131"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v033.i01"},{"key":"e_1_2_1_7_1","first-page":"1561","volume-title":"AAAI","author":"Fujiwara Y.","year":"2016"},{"key":"e_1_2_1_8_1","first-page":"784","volume-title":"ICML","author":"Fujiwara Y.","year":"2014"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735496.2735498"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783280"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2891460.2891614"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"e_1_2_1_13_1","volume-title":"Springer","author":"Hastie T.","year":"2011"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr558"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33454-2_48"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000000281"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2724578"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"e_1_2_1_19_1","first-page":"607","volume-title":"ECAI","author":"Nakatsuji M.","year":"2010"},{"key":"e_1_2_1_20_1","volume-title":"Cambridge University Press","author":"Press W. H.","year":"2007"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809980"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/993490"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"R. Tibshirani J. Bien J. Friedman T. Hastie N. Simon J. Taylor and R. J. Tibshirani. Strong Rules for Discarding Predictors in Lasso-type Problems. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 74(2):245--266 2012.  R. Tibshirani J. Bien J. Friedman T. Hastie N. Simon J. Taylor and R. J. Tibshirani. Strong Rules for Discarding Predictors in Lasso-type Problems. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 74(2):245--266 2012.","DOI":"10.1111\/j.1467-9868.2011.01004.x"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190672"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3021924.3021938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:29:23Z","timestamp":1672219763000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3021924.3021938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["10.14778\/3021924.3021938"],"URL":"https:\/\/doi.org\/10.14778\/3021924.3021938","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}