{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T09:09:44Z","timestamp":1769764184313,"version":"3.49.0"},"reference-count":20,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2023,4,1]]},"DOI":"10.1587\/transinf.2022iip0010","type":"journal-article","created":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T22:28:23Z","timestamp":1680301703000},"page":"433-442","source":"Crossref","is-referenced-by-count":4,"title":["Influence Propagation Based Influencer Detection in Online Forum"],"prefix":"10.1587","volume":"E106.D","author":[{"given":"Wen","family":"GU","sequence":"first","affiliation":[{"name":"Japan Advanced Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shohei","family":"KATO","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fenghui","family":"REN","sequence":"additional","affiliation":[{"name":"University of Wollongong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoxin","family":"SU","sequence":"additional","affiliation":[{"name":"University of Wollongong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayuki","family":"ITO","sequence":"additional","affiliation":[{"name":"Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinobu","family":"HASEGAWA","sequence":"additional","affiliation":[{"name":"Japan Advanced Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Y. Li, J. Fan, Y. Wang, and K. Tan, \u201cInfluence maximization on social graphs: A survey,\u201d IEEE Trans. Knowl. Data Eng., vol.30, no.10, pp.1852-1872, Oct. 2018. 10.1109\/TKDE.2018.2807843","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] D. Kempe, J. Kleinberg, and \u00c9. Tardos, \u201cMaximizing the spread of influence through a social network,\u201d Proc. 9th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, pp.137-146, Aug. 2003. 10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S. Peng, A. Yang, L. Cao, S. Yu, and D. Xie, \u201cSocial influence modeling using information theory in mobile social networks,\u201d Information Science, vol.379, pp.146-159, Feb. 2017. 10.1016\/j.ins.2016.08.023","DOI":"10.1016\/j.ins.2016.08.023"},{"key":"4","unstructured":"[4] T. Ito, Y. Imi, T. Ito, and E. Hideshima, \u201cCOLLAGREE: A facilitator-mediated large-scale consensus support system,\u201d ACM Collective Intelligence 2014."},{"key":"5","unstructured":"[5] K. Takahashi, T. Ito, T. Ito, E. Hideshima, S. Shiramatsu, A. Sengoku, and K. Fujita, \u201cIncentive mechanism based on quality of opinion for large-scale discussion support,\u201d ACM Collective Intelligence 2016."},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] J. Goldenberg, B. Libai, and E. Muller, \u201cTalk of the network: A complex systems look at the underlying process of word-of-mouth,\u201d Mark. Lett., vol.12, no.3, pp.211-223, 2001. 10.1023\/A:1011122126881","DOI":"10.1023\/A:1011122126881"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] W. Gu, S. Kato, F. Ren, G. Su, and T. Ito, \u201cInfluential online forum user detection based on user contribution and relevance,\u201d Proc. 2021 IEEE Int. Conf. Agents (ICA), pp.13-18, 2021. 10.1109\/ICA54137.2021.00009","DOI":"10.1109\/ICA54137.2021.00009"},{"key":"8","unstructured":"[8] L. Page, S. Brin, R. Motwani, and T. Winograd, \u201cThe pagerank citation ranking: Bringing order to the web,\u201d Stanford InfoLab Technical Report, 1999."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] R. Albert, H. Jeong, and A.-L. Barab\u00e1si, \u201cError and attack tolerance of complex networks,\u201d Nature, vol.406, pp.378-382, 2000. 10.1038\/35019019","DOI":"10.1038\/35019019"},{"key":"10","unstructured":"[10] X. Tang and C.C. Yang \u201cIdentifing influential users in an online healthcare social network,\u201d Proc. 2010 IEEE Int. Conf. Intelligence and Security Informatics, pp.43-48, 2010. 10.1109\/ISI.2010.5484779"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] M. Granovetter, \u201cThreshold models of collective behavior,\u201d Am. J. Sociol., vol.83, no.6, pp.1420-1443, 1978. 10.1086\/226707","DOI":"10.1086\/226707"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] W. Chen, Y. Wang, and S. Yang, \u201cEfficient influence maximization in social networks,\u201d Proc. 15th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, pp.199-208, June 2009. 10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, \u201cCost-effective outbreak detection in networks,\u201d Proc. 13th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, pp.420-429, Aug. 2007. 10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Y. Tang, X. Xiao, and Y. Shi, \u201cInfluence maximization: Near-optimal time complexity meets practical efficiency,\u201d Proc. 2014 ACM SIGKDD Int. Conf. Management of Data, pp.75-86, June 2014. 10.1145\/2588555.2593670","DOI":"10.1145\/2588555.2593670"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] M. Gomez-Rodriguez, L. Song, N. Du, H. Zha, and B. Sch\u00f6lkopf, \u201cInfluence estimation and maximization in continuous-time diffusion networks,\u201d ACM Trans. Information Systems, vol.34, no.2, Article No. 9, pp.1-33, Feb. 2016. 10.1145\/2824253","DOI":"10.1145\/2824253"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] W. Li, Q. Bai, C. Jiang, and M. Zhang, \u201cStigmergy-based influence maximization in social networks,\u201d PRICAI 2016: Trends in Artificial Intelligence, pp.750-762, 2016. 10.1007\/978-3-319-42911-3_63","DOI":"10.1007\/978-3-319-42911-3_63"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] W. Li, Q. Bai, and M. Zhang, \u201cSIMiner: A stigmergy-based model for mining influential nodes in dynamic social networks,\u201d IEEE Trans. Big Data, vol.5, no.2, pp.223-237, June 2019. 10.1109\/TBDATA.2018.2824826","DOI":"10.1109\/TBDATA.2018.2824826"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] P. Liu, A.R. Benson, and M. Charikar, \u201cSampling methods for counting temporal motifs,\u201d Proc. 12th ACM Int. Conf. Web Search and Data Mining, pp.294-302, Jan. 2019. 10.1145\/3289600.3290988","DOI":"10.1145\/3289600.3290988"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] J. Hessel, C. Tan, and L. Lee, \u201cScience, AskScience, and BadScience: On the coexistence of highly related communities,\u201d Proc. 10th International AAAI Conference on Web and Social Media, vol.10, no.1, pp.171-180, 2016. 10.1609\/icwsm.v10i1.14739","DOI":"10.1609\/icwsm.v10i1.14739"},{"key":"20","unstructured":"[20] pushshirt.io, https:\/\/pushshift.io\/."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/4\/E106.D_2022IIP0010\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T04:35:15Z","timestamp":1680323715000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/4\/E106.D_2022IIP0010\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,1]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022iip0010","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,1]]},"article-number":"2022IIP0010"}}