{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:07:11Z","timestamp":1743152831312,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811904677"},{"type":"electronic","value":"9789811904684"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-0468-4_4","type":"book-chapter","created":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T14:02:47Z","timestamp":1645797767000},"page":"38-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Active Malicious Accounts Detection with Multimodal Fusion Machine Learning Algorithm"],"prefix":"10.1007","author":[{"given":"Yuting","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dafang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuan-Ching","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitin","family":"Sukhija","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,26]]},"reference":[{"issue":"4","key":"4_CR1","first-page":"429","volume":"34","author":"F Sheikhi","year":"2020","unstructured":"Sheikhi, F.: An efficient method for detection of fake accounts on the Instagram platform. Rev. D Intell. Artif. 34(4), 429\u2013436 (2020)","journal-title":"Rev. D Intell. Artif."},{"key":"4_CR2","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.1526484","volume-title":"Uncovering Social Network Structures Through Penetration Data","author":"Y Dover","year":"2009","unstructured":"Dover, Y., Goldenberg, J., Shapira, D.: Uncovering Social Network Structures Through Penetration Data. Social Science Electronic Publishing, Rochester (2009)"},{"key":"4_CR3","unstructured":"Schuetz, S.W., Wei, J.: When your friends render you vulnerable: a social network analysis perspective on users\u2019 vulnerability to socially engineered phishing attacks. In: ICIS 2019 (2019)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Stein, T., Chen, E., Mangla, K.: Facebook immune system. In: Proceedings of the 4th Workshop on Social Network Systems, pp. 1\u20138 (2011)","DOI":"10.1145\/1989656.1989664"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Lyu, C., et al.: Predictable model for detecting sybil attacks in mobile social networks. In: 2021 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1\u20136. IEEE (2021)","DOI":"10.1109\/WCNC49053.2021.9417254"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-030-66046-8_30","volume-title":"Computational Data and Social Networks","author":"A Lobo","year":"2020","unstructured":"Lobo, A., Mandekar, Y., Pundpal, S., Roy, B.: Detection of sybil attacks in social networks. In: Chellappan, S., Choo, K.-K., Phan, N. (eds.) CSoNet. LNCS, vol. 12575, pp. 366\u2013377. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-66046-8_30"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0138-z","volume":"4","author":"EHW Xu","year":"2019","unstructured":"Xu, E.H.W., Hui, P.M.: Uncovering complex overlapping pattern of communities in large-scale social networks. Appl. Netw. Sci. 4(1), 1\u201316 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0138-z","journal-title":"Appl. Netw. Sci."},{"key":"4_CR8","unstructured":"Wang, G., Konolige, T., Wilson, C., Wang, X., Zheng, H., Zhao, B.Y.: You are how you click: clickstream analysis for sybil detection. In: 22nd USENIX Security Symposium ({USENIX}Security 13), pp. 241\u2013256 (2013)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Shin, K., Hooi, B., Kim, J., Faloutsos, C.: D-cube: dense-block detection interabyte-scale tensors. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pp. 681\u2013689 (2017)","DOI":"10.1145\/3018661.3018676"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.neucom.2020.02.098","volume":"399","author":"B Tang","year":"2020","unstructured":"Tang, B., Zhang, L.: Local preserving logistic i-relief for semi-supervised feature selection. Neurocomputing 399, 48\u201364 (2020)","journal-title":"Neurocomputing"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Chen, J., Tang, G.: A feature selection model to filter periodic variable stars with data-sensitive light-variable characteristics. J. Signal Process. Syst. 93(7), 733\u2013744 (2021)","DOI":"10.1007\/s11265-021-01637-3"},{"key":"4_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/9781584888796","volume-title":"Computational Methods of Feature Selection","author":"H Liu","year":"2007","unstructured":"Liu, H., Motoda, H.: Computational Methods of Feature Selection. CRC Press, Boca Raton (2007)"},{"issue":"5","key":"4_CR13","doi-asserted-by":"publisher","first-page":"12871","DOI":"10.1007\/s10586-018-1789-8","volume":"22","author":"B Selvalakshmi","year":"2018","unstructured":"Selvalakshmi, B., Subramaniam, M.: Intelligent ontology based semantic information retrieval using feature selection and classification. Clust. Comput. 22(5), 12871\u201312881 (2018). https:\/\/doi.org\/10.1007\/s10586-018-1789-8","journal-title":"Clust. Comput."},{"key":"4_CR14","unstructured":"Ndaoud, M.: Contributions to variable selection, clustering and statistical estimation in high dimension (2019)"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Wang, X., Wang, Z., Zhang, Y., Jiang, X., Cai, Z.: Latent representation learning based autoencoder for unsupervised feature selection in hyper-spectral imagery. Multimedia Tools Appl. 1\u201315 (2021). https:\/\/doi.org\/10.1007\/s11042-020-10474-8","DOI":"10.1007\/s11042-020-10474-8"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"104741","DOI":"10.1016\/j.knosys.2019.04.011","volume":"181","author":"L Zhang","year":"2019","unstructured":"Zhang, L., Huang, X., Zhou, W.: Logistic local hyperplane-relief: a feature weighting method for classification. Knowl.-Based Syst. 181, 104741 (2019)","journal-title":"Knowl.-Based Syst."},{"key":"4_CR17","unstructured":"Klein, A., Melard, G.: Invertibility condition of the fisher information matrix of a varmax process and the tensor sylvester matrix. In: Working Papers ECARES (2020)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.knosys.2018.11.034","volume":"165","author":"A Kl","year":"2019","unstructured":"Kl, A., Xy, A., Hy, A., Jm, B., Pwb, C., Xc, A.: Rough set based semi-supervised feature selection via ensemble selector. Knowl.-Based Syst. 165, 282\u2013296 (2019)","journal-title":"Knowl.-Based Syst."},{"issue":"6","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3136625","volume":"50","author":"J Li","year":"2016","unstructured":"Li, J., et al.: Feature selection: a data perspective. ACM Comput. Surv. 50(6), 1\u201345 (2016)","journal-title":"ACM Comput. Surv."},{"key":"4_CR20","unstructured":"Zeng, X., Zheng, H.: CS sparse k-means: An algorithm for cluster-specific feature selection in high-dimensional clustering (2019)"},{"key":"4_CR21","unstructured":"Jza, B., Hp, A., Jt, A., Ql, A.: Generalized refined composite multiscale fuzzy entropy and multi-cluster feature selection based intelligent fault diagnosis of rolling bearing. ISA Trans. (2021)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Li, K., Zhang, J., Fang, Z.: Communication emitter identification based on kernel semi-supervised discriminant analysis. In: 2019 IEEE International Conference on Power, Intelligent Computing and Systems (ICPICS) (2019)","DOI":"10.1109\/ICPICS47731.2019.8942464"},{"issue":"5","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1109\/TKDE.2013.86","volume":"26","author":"K Benabdeslem","year":"2014","unstructured":"Benabdeslem, K., Hindawi, M.: Efficient semi-supervised feature selection: constraint, relevance, and redundancy. IEEE Trans. Knowl. Data Eng. 26(5), 1131\u20131143 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"4_CR24","first-page":"1","volume":"2020","author":"H Fang","year":"2020","unstructured":"Fang, H., Tang, P., Si, H.: Feature selections using minimal redundancy maximal relevance algorithm for human activity recognition in smarthome environments. J. Healthc. Eng. 2020(1), 1\u201313 (2020)","journal-title":"J. Healthc. Eng."},{"issue":"04","key":"4_CR25","doi-asserted-by":"publisher","first-page":"1750036","DOI":"10.1142\/S0219649217500368","volume":"16","author":"A Rastogi","year":"2017","unstructured":"Rastogi, A., Mehrotra, M.: Opinion spam detection in online reviews. J. Inf. Knowl. Manag. 16(04), 1750036 (2017)","journal-title":"J. Inf. Knowl. Manag."},{"key":"4_CR26","unstructured":"Gayo-Avello, D., Brenes, D.J.: Overcoming spammers in Twitter-a taleof five algorithms (2010)"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"12","DOI":"10.4018\/IJWLTT.20210701.oa2","volume":"16","author":"BL Velammal","year":"2021","unstructured":"Velammal, B.L., Aarthy, N.: Improvised spam detection in twitter datausing lightweight detectors and classifiers. Int. J. Web-Based Learn. Teach. Technol. (IJWLTT) 16, 12\u201332 (2021)","journal-title":"Int. J. Web-Based Learn. Teach. Technol. (IJWLTT)"},{"issue":"6","key":"4_CR28","first-page":"1336","volume":"39","author":"MM Mojiri","year":"2020","unstructured":"Mojiri, M.M., Ravanmehr, R.: Event detection in Twitter using multi timing chained windows. Comput. Inf. 39(6), 1336\u20131359 (2020)","journal-title":"Comput. Inf."},{"issue":"3","key":"4_CR29","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10796-017-9805-8","volume":"20","author":"R Aswani","year":"2018","unstructured":"Aswani, R., Kar, A.K., Ilavarasan, P.V.: Detection of spammers in Twitter marketing: a hybrid approach using social media analytics and bioinspired computing. Inf. Syst. Front. 20(3), 515\u2013530 (2018)","journal-title":"Inf. Syst. Front."},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"012081","DOI":"10.1088\/1742-6596\/1955\/1\/012081","volume":"1955","author":"C Youlve","year":"2021","unstructured":"Youlve, C., Kaiyun, B., Jiangtian, C.: Credit decision system based on combination weight and extreme gradient boosting algorithm. J. Phys. Conf. Ser. 1955, 012081(2021)","journal-title":"J. Phys. Conf. Ser."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-46128-1_17","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"K Shin","year":"2016","unstructured":"Shin, K., Hooi, B., Faloutsos, C.: M-zoom: fast dense-block detection in tensors with quality guarantees. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9851, pp. 264\u2013280. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46128-1_17"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Jiang, M., Beutel, A., Cui, P., Hooi, B., Yang, S., Faloutsos, C.: A general suspiciousness metric for dense blocks in multimodal data. In: 2015 IEEE International Conference on Data Mining, pp. 781\u2013786. IEEE (2015)","DOI":"10.1109\/ICDM.2015.61"}],"container-title":["Communications in Computer and Information Science","Ubiquitous Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-0468-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T14:14:44Z","timestamp":1645798484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-0468-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811904677","9789811904684"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-0468-4_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UbiSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Inernational Conference on Ubiquitous Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ubisec2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ubisecurity.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"96","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":"26","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":"2","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":"27% - 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":"3","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}