{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:10Z","timestamp":1740109330321,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10115-022-01683-8","type":"journal-article","created":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T19:02:30Z","timestamp":1653159750000},"page":"1571-1602","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Autonomous graph mining algorithm search with best performance trade-off"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3693-9127","authenticated-orcid":false,"given":"Minji","family":"Yoon","sequence":"first","affiliation":[]},{"given":"Th\u00e9ophile","family":"Gervet","sequence":"additional","affiliation":[]},{"given":"Bryan","family":"Hooi","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,21]]},"reference":[{"issue":"3","key":"1683_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.14778\/1929861.1929864","volume":"4","author":"B Bahmani","year":"2010","unstructured":"Bahmani B, Chowdhury A, Goel A (2010) Fast incremental and personalized pagerank. Proc VLDB Endow 4(3):173\u2013184","journal-title":"Proc VLDB Endow"},{"key":"1683_CR2","doi-asserted-by":"crossref","unstructured":"Bennett J, Lanning S (2007) August. The netflix prize. In Proceedings of KDD cup and workshop (Vol. 2007, p. 35)","DOI":"10.1145\/1345448.1345459"},{"key":"1683_CR3","unstructured":"Brochu E, Cora VM, De Freitas N (2010) A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning. arXiv preprint arXiv:1012.2599"},{"issue":"1","key":"1683_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-7-488","volume":"7","author":"S Brohee","year":"2006","unstructured":"Brohee S, Van Helden J (2006) Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinf 7(1):1\u201319","journal-title":"BMC Bioinf"},{"key":"1683_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ins.2014.10.015","volume":"295","author":"R Dre\u017cewski","year":"2015","unstructured":"Dre\u017cewski R, Sepielak J, Filipkowski W (2015) The application of social network analysis algorithms in a system supporting money laundering detection. Inf Sci 295:18\u201332","journal-title":"Inf Sci"},{"key":"1683_CR6","doi-asserted-by":"crossref","unstructured":"Eksombatchai C, Jindal P, Liu JZ, Liu Y, Sharma R, Sugnet C, Ulrich M, Leskovec J (2018) April. Pixie: a system for recommending 3+ billion items to 200+ million users in real-time. In: Proceedings of the 2018 world wide web conference. pp. 1775\u20131784","DOI":"10.1145\/3178876.3186183"},{"issue":"1","key":"1683_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s12065-007-0002-4","volume":"1","author":"D Floreano","year":"2008","unstructured":"Floreano D, D\u00fcrr P, Mattiussi C (2008) Neuroevolution: from architectures to learning. Evol Intel 1(1):47\u201362","journal-title":"Evol Intel"},{"key":"1683_CR8","first-page":"1403","volume":"20","author":"Y Gao","year":"2020","unstructured":"Gao Y, Yang H, Zhang P, Zhou C, Hu Y (2020) July. Graph neural architecture search. IJCAI 20:1403\u20131409","journal-title":"IJCAI"},{"key":"1683_CR9","unstructured":"Guo M, Yi T, Zhu Y, Bao Y (2021) Jitune: Just-in-time hyperparameter tuning for network embedding algorithms. arXiv preprint arXiv:2101.06427"},{"key":"1683_CR10","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Advances in neural information processing systems, 30"},{"key":"1683_CR11","doi-asserted-by":"crossref","unstructured":"Hooi B, Song HA, Beutel A, Shah N, Shin K, Faloutsos C (2016) August. Fraudar: Bounding graph fraud in the face of camouflage. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. pp. 895\u2013904","DOI":"10.1145\/2939672.2939747"},{"key":"1683_CR12","doi-asserted-by":"crossref","unstructured":"Hu Z, Dong Y, Wang K, Sun Y (2020) April. Heterogeneous graph transformer. In: Proceedings of The Web Conference 2020. pp. 2704\u20132710","DOI":"10.1145\/3366423.3380027"},{"key":"1683_CR13","unstructured":"Kandasamy K, Dasarathy G, Oliva JB, Schneider J, P\u00f3czos B (2016) Gaussian process bandit optimisation with multi-fidelity evaluations. Advances in neural information processing systems, 29"},{"key":"1683_CR14","unstructured":"Kandasamy K, Dasarathy G, Schneider J, P\u00f3czos B (2017) July. Multi-fidelity bayesian optimisation with continuous approximations. In: International Conference on Machine Learning. PMLR. pp. 1799\u20131808"},{"key":"1683_CR15","unstructured":"Kandasamy K, Neiswanger W, Schneider J, Poczos B, Xing EP (2018) Neural architecture search with bayesian optimisation and optimal transport. Advances in neural information processing systems, 31"},{"key":"1683_CR16","unstructured":"Kingma DP, Ba J (2014) Adam: a method for stochastic optimization. Proceedings of the 3rd International Conference on Learning Representations 2014"},{"key":"1683_CR17","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: 5th International Conference on Learning Representations 2017"},{"key":"1683_CR18","first-page":"461","volume":"4","author":"H Kitano","year":"1990","unstructured":"Kitano H (1990) Designing neural networks using genetic algorithms with graph generation system. Complex Syst 4:461\u2013476","journal-title":"Complex Syst"},{"issue":"5","key":"1683_CR19","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM (JACM) 46(5):604\u2013632","journal-title":"J ACM (JACM)"},{"key":"1683_CR20","doi-asserted-by":"crossref","unstructured":"Koutra D, Ke TY, Kang U, Chau DHP, Pao HKK, Faloutsos C (2011) September. Unifying guilt-by-association approaches: theorems and fast algorithms. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases (pp. 245\u2013260). Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-23783-6_16"},{"key":"1683_CR21","doi-asserted-by":"crossref","unstructured":"Lemaire C, Achkar A, Jodoin PM (2019) Structured pruning of neural networks with budget-aware regularization. In Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. pp. 9108\u20139116","DOI":"10.1109\/CVPR.2019.00932"},{"key":"1683_CR22","doi-asserted-by":"crossref","unstructured":"Li X, Zhou Y, Pan Z, Feng J (2019) Partial order pruning: for best speed\/accuracy trade-off in neural architecture search. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. pp. 9145\u20139153","DOI":"10.1109\/CVPR.2019.00936"},{"key":"1683_CR23","unstructured":"Liu H, Simonyan K, Yang Y (2019) Darts: differentiable architecture search. International Conference on Learning Representations, ICLR 2019"},{"key":"1683_CR24","unstructured":"Liu H, Simonyan K, Vinyals O, Fernando C, Kavukcuoglu K (2017) Hierarchical representations for efficient architecture search. International Conference on Learning Representations, ICLR 2018"},{"issue":"247","key":"1683_CR25","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/01621459.1949.10483310","volume":"44","author":"N Metropolis","year":"1949","unstructured":"Metropolis N, Ulam S (1949) The Monte Carlo method. J Am Stat Assoc 44(247):335\u2013341","journal-title":"J Am Stat Assoc"},{"key":"1683_CR26","unstructured":"Michalak K, Korczak J (2011) September. Graph mining approach to suspicious transaction detection. In 2011 Federated conference on computer science and information systems (FedCSIS) (pp. 69\u201375). IEEE"},{"key":"1683_CR27","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. Stanford InfoLab"},{"key":"1683_CR28","doi-asserted-by":"crossref","unstructured":"Pearl J (2022) Reverend Bayes on inference engines: a distributed hierarchical approach. In Probabilistic and Causal Inference: The Works of Judea Pearl. pp. 129\u2013138","DOI":"10.1145\/3501714.3501727"},{"key":"1683_CR29","volume-title":"Linear programming: foundations and extensions","author":"JV Robert","year":"2021","unstructured":"Robert JV (2021) Linear programming: foundations and extensions. Springer, Berlin"},{"issue":"3","key":"1683_CR30","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93\u201393","journal-title":"AI Mag"},{"key":"1683_CR31","unstructured":"Shchur O, Mumme M, Bojchevski A, G\u00fcnnemann S (2018) 2018. Pitfalls of graph neural network evaluation, Relational Representation Learning Workshop, NeurIPS"},{"key":"1683_CR32","doi-asserted-by":"crossref","unstructured":"Shin K, Eliassi-Rad T, Faloutsos C (2016) December. Corescope: Graph mining using k-core analysis-patterns, anomalies and algorithms. In: 2016 IEEE 16th international conference on data mining (ICDM) (pp. 469\u2013478). IEEE","DOI":"10.1109\/ICDM.2016.0058"},{"key":"1683_CR33","doi-asserted-by":"crossref","unstructured":"Strehl A, Ghosh J (2000) December. A scalable approach to balanced, high-dimensional clustering of market-baskets. In International Conference on High-Performance Computing (pp. 525\u2013536). Springer, Berlin, Heidelberg","DOI":"10.1007\/3-540-44467-X_48"},{"issue":"1","key":"1683_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0021-9800(68)80081-X","volume":"4","author":"G Szekeres","year":"1968","unstructured":"Szekeres G, Wilf HS (1968) An inequality for the chromatic number of a graph. J Comb Theory 4(1):1\u20133","journal-title":"J Comb Theory"},{"key":"1683_CR35","doi-asserted-by":"crossref","unstructured":"Tu K, Ma J, Cui P, Pei J, Zhu W (2019) July. Autone: Hyperparameter optimization for massive network embedding. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp. 216\u2013225","DOI":"10.1145\/3292500.3330848"},{"issue":"6","key":"1683_CR36","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1038\/nbt825","volume":"21","author":"A Vazquez","year":"2003","unstructured":"Vazquez A, Flammini A, Maritan A, Vespignani A (2003) Global protein function prediction from protein-protein interaction networks. Nat Biotechnol 21(6):697\u2013700","journal-title":"Nat Biotechnol"},{"key":"1683_CR37","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2018) 6th International Conference on Learning Representations , ICLR 2018"},{"key":"1683_CR38","doi-asserted-by":"crossref","unstructured":"Wang Y, Liu S, Yoon M, Lamba H, Wang W, Faloutsos C, Hooi B (2020) November. Provably robust node classification via low-pass message passing. In: 2020 IEEE International Conference on Data Mining (ICDM) (pp. 621\u2013630). IEEE","DOI":"10.1109\/ICDM50108.2020.00071"},{"issue":"67\u201368","key":"1683_CR39","first-page":"7","volume":"35","author":"S Wright","year":"1999","unstructured":"Wright S, Nocedal J (1999) Numerical optimization. Springer Sci 35(67\u201368):7","journal-title":"Springer Sci"},{"key":"1683_CR40","unstructured":"Wu F, Souza A, Zhang T, Fifty C, Yu T, Weinberger K (2019) May. Simplifying graph convolutional networks. In International conference on machine learning (pp. 6861\u20136871). PMLR"},{"issue":"1","key":"1683_CR41","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE Trans ctions Neural Networks Learn Systems 32(1):4\u201324","journal-title":"IEEE Trans ctions Neural Networks Learn Systems"},{"key":"1683_CR42","doi-asserted-by":"crossref","unstructured":"Yao L, Mao C, Luo Y (2019) July. Graph convolutional networks for text classification. In Proceedings of the AAAI conference on artificial intelligence (Vol. 33, No. 01, pp. 7370-7377)","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"1683_CR43","doi-asserted-by":"crossref","unstructured":"Yoon M, Jung J, Kang U (2018) April. Tpa: fast, scalable, and accurate method for approximate random walk with restart on billion scale graphs. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE) (pp. 1132\u20131143). IEEE","DOI":"10.1109\/ICDE.2018.00105"},{"key":"1683_CR44","doi-asserted-by":"crossref","unstructured":"Yoon M, Jin W, Kang U (2018) April. Fast and accurate random walk with restart on dynamic graphs with guarantees. In: Proceedings of the 2018 World Wide Web Conference (pp. 409\u2013418)","DOI":"10.1145\/3178876.3186107"},{"key":"1683_CR45","doi-asserted-by":"crossref","unstructured":"Yoon M, Hooi B, Shin K, Faloutsos C (2019) July. Fast and accurate anomaly detection in dynamic graphs with a two-pronged approach. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 647\u2013657)","DOI":"10.1145\/3292500.3330946"},{"key":"1683_CR46","doi-asserted-by":"crossref","unstructured":"Yoon M, Gervet T, Hooi B, Faloutsos C (2020) November. Autonomous graph mining algorithm search with best speed\/accuracy trade-off. In: 2020 IEEE International Conference on Data Mining (ICDM) (pp. 751\u2013760). IEEE","DOI":"10.1109\/ICDM50108.2020.00084"},{"key":"1683_CR47","first-page":"17009","volume":"33","author":"J You","year":"2020","unstructured":"You J, Ying Z, Leskovec J (2020) Design space for graph neural networks. Adv Neural Inf Process Syst 33:17009\u201317021","journal-title":"Adv Neural Inf Process Syst"},{"key":"1683_CR48","doi-asserted-by":"crossref","unstructured":"Yuan Y, Wang W, Coghill GM, Pang W (2021) A novel genetic algorithm with hierarchical evaluation strategy for hyperparameter optimisation of graph neural networks. arXiv preprint arXiv:2101.09300","DOI":"10.1109\/CEC45853.2021.9504717"},{"key":"1683_CR49","doi-asserted-by":"crossref","unstructured":"Zamir O, Etzioni O (1998) August. Web document clustering: a feasibility demonstration. In Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval (pp. 46\u201354)","DOI":"10.1145\/290941.290956"},{"key":"1683_CR50","doi-asserted-by":"crossref","unstructured":"Zhang Z, Wang X, Zhu W (2021) Automated machine learning on graphs: a survey. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21), Survey Track","DOI":"10.24963\/ijcai.2021\/637"},{"key":"1683_CR51","unstructured":"Zhong Z, Yan J, Liu CL (2017) Practical network blocks design with q-learning. arXiv preprint arXiv:1708.05552, 6"},{"key":"1683_CR52","unstructured":"Zoph B, Le QV (2017) Neural architecture search with reinforcement learning. International Conference on Learning Representations, ICLR 2017"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01683-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01683-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01683-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,4]],"date-time":"2022-06-04T09:12:04Z","timestamp":1654333924000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01683-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,21]]},"references-count":52,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1683"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01683-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2022,5,21]]},"assertion":[{"value":"29 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}