乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T17:07:01Z","timestamp":1726247221440},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031539657"},{"type":"electronic","value":"9783031539664"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-53966-4_11","type":"book-chapter","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:02:29Z","timestamp":1707933749000},"page":"140-148","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heaviest and\u00a0Densest Subgraph Computation for\u00a0Binary Classification. A\u00a0Case Study"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"Tasn\u00e1di","sequence":"first","affiliation":[]},{"given":"No\u00e9mi","family":"Gask\u00f3","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,15]]},"reference":[{"key":"11_CR1","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-030-36674-2_37","volume-title":"Advanced Intelligent Systems for Sustainable Development (AI2SD\u20192019)","author":"F Abid","year":"2020","unstructured":"Abid, F., Izeboudjen, N.: Predicting forest fire in Algeria using data mining techniques: case study of the decision tree algorithm. In: Ezziyyani, M. (ed.) AI2SD 2019. AISC, vol. 1105, pp. 363\u2013370. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36674-2_37"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Ara\u00fajo, B., Zhao, L.: Data heterogeneity consideration in semi-supervised learning. Expert Syst. Appl. 45, 234\u2013247 (2016). https:\/\/doi.org\/10.1016\/j.eswa.2015.09.026, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417415006545","DOI":"10.1016\/j.eswa.2015.09.026"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Bertini, J.R., Zhao, L., Motta, R., de Andrade Lopes, A.: A nonparametric classification method based on k-associated graphs. Inf. Sci. 181(24), 5435\u20135456 (2011). https:\/\/doi.org\/10.1016\/j.ins.2011.07.043, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025511003823","DOI":"10.1016\/j.ins.2011.07.043"},{"issue":"11","key":"11_CR4","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1016\/j.cor.2008.12.020","volume":"36","author":"J Brimberg","year":"2009","unstructured":"Brimberg, J., Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Ngai, E.: Variable neighborhood search for the heaviest k-subgraph. Comput. Oper. Res. 36(11), 2885\u20132891 (2009)","journal-title":"Comput. Oper. Res."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.neunet.2018.12.003","volume":"110","author":"MG Carneiro","year":"2019","unstructured":"Carneiro, M.G., Cheng, R., Zhao, L., Jin, Y.: Particle swarm optimization for network-based data classification. Neural Netw. 110, 243\u2013255 (2019)","journal-title":"Neural Netw."},{"issue":"8","key":"11_CR6","doi-asserted-by":"publisher","first-page":"3361","DOI":"10.1109\/TNNLS.2017.2726082","volume":"29","author":"MG Carneiro","year":"2018","unstructured":"Carneiro, M.G., Zhao, L.: Organizational data classification based on the importance concept of complex networks. IEEE Trans. Neural Netw. Learn. Syst. 29(8), 3361\u20133373 (2018). https:\/\/doi.org\/10.1109\/TNNLS.2017.2726082","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Ciresan, D.C., Meier, U., Gambardella, L.M., Schmidhuber, J.: Convolutional neural network committees for handwritten character classification. In: 2011 International Conference on Document Analysis and Recognition, pp. 1135\u20131139. IEEE (2011)","DOI":"10.1109\/ICDAR.2011.229"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Kesavaraj, G., Sukumaran, S.: A study on classification techniques in data mining. In: 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT), pp. 1\u20137 (2013)","DOI":"10.1109\/ICCCNT.2013.6726842"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02060482","volume":"40","author":"RK Kincaid","year":"1992","unstructured":"Kincaid, R.K.: Good solutions to discrete noxious location problems via metaheuristics. Ann. Oper. Res. 40(1), 265\u2013281 (1992)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"11_CR10","first-page":"7","volume":"1","author":"R Kumar","year":"2012","unstructured":"Kumar, R., Verma, R.: Classification algorithms for data mining: a survey. Int. J. Innov. Eng. Technol. (IJIET) 1(2), 7\u201314 (2012)","journal-title":"Int. J. Innov. Eng. Technol. (IJIET)"},{"issue":"5","key":"11_CR11","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1080\/01431160600746456","volume":"28","author":"D Lu","year":"2007","unstructured":"Lu, D., Weng, Q.: A survey of image classification methods and techniques for improving classification performance. Int. J. Remote Sens. 28(5), 823\u2013870 (2007)","journal-title":"Int. J. Remote Sens."},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-012-0604-1","volume":"136","author":"J Malick","year":"2012","unstructured":"Malick, J., Roupin, F.: Solving $$ k $$-cluster problems to optimality with semidefinite programming. Math. Program. 136(2), 279\u2013300 (2012)","journal-title":"Math. Program."},{"key":"11_CR13","unstructured":"Phyu, T.N.: Survey of classification techniques in data mining. In: Proceedings of the International Multiconference of Engineers and Computer Scientists, vol. 1, pp. 727\u2013731. Citeseer (2009)"},{"issue":"6","key":"11_CR14","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TNNLS.2012.2195027","volume":"23","author":"TC Silva","year":"2012","unstructured":"Silva, T.C., Zhao, L.: Network-based high level data classification. IEEE Trans. Neural Netw. Learn. Syst. 23(6), 954\u2013970 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"11_CR15","unstructured":"Szummer, M., Jaakkola, T.: Partially labeled classification with Markov random walks. In: Advances in Neural Information Processing Systems, vol. 14 (2001)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Tasn\u00e1di, Z., Gask\u00f3, N.: An ant colony optimisation approach to the densest k-subgraph problem. In: 2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 208\u2013211. IEEE (2022)","DOI":"10.1109\/SYNASC57785.2022.00039"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-031-21094-5_4","volume-title":"Bioinspired Optimization Methods and Their Applications","author":"Z Tasn\u00e1di","year":"2022","unstructured":"Tasn\u00e1di, Z., Gask\u00f3, N.: A new type of anomaly detection problem in dynamic graphs: an ant colony optimization approach. In: Mernik, M., Eftimov, T., \u010crepin\u0161ek, M. (eds.) BIOMA 2022. LNCS, vol. 13627, pp. 46\u201353. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21094-5_4"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53966-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:04:10Z","timestamp":1707933850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53966-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031539657","9783031539664"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53966-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"15 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grasmere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2023.icas.cc\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In-house system and EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5-6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}