( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Growth Analysis of Purchase History Graph Based on Relative Value of Edge Multiplicity.

, , и . iiWAS, стр. 65-69. ACM, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Takayasu Shimizu

Miriam Takayasu

 

Другие публикации лиц с тем же именем

Graph generation method based on relative value of neighbor edges., , и . iiWAS, стр. 358-365. ACM, (2017)A New Group Centrality Measure for Maximizing the Connectedness of Network Under Uncertain Connectivity., , , и . COMPLEX NETWORKS (1), том 812 из Studies in Computational Intelligence, стр. 3-14. Springer, (2018)Stimulation Index of Cascading Transmission in Information Diffusion over Social Networks., , и . COMPLEX NETWORKS (1), том 943 из Studies in Computational Intelligence, стр. 469-481. Springer, (2020)Functional cluster extraction from large spatial networks., , , и . ASONAM, стр. 57-62. IEEE Computer Society, (2016)Audience Prediction for Game Streaming Channels Based on Vectorization of User Comments., и . DS, том 14276 из Lecture Notes in Computer Science, стр. 81-95. Springer, (2023)Estimating Network Structure from Anonymous Ego-centric Information., , и . PKAW, том 8863 из Lecture Notes in Computer Science, стр. 236-245. Springer, (2014)Improving approximate extraction of functional similar regions from large-scale spatial networks based on greedy selection of representative nodes of different areas., , , и . Appl. Netw. Sci., 3 (1): 18:1-18:14 (2018)Growth Analysis of Purchase History Graph Based on Relative Value of Edge Multiplicity., , и . iiWAS, стр. 65-69. ACM, (2018)Maximizing Network Coverage Under the Presence of Time Constraint by Injecting Most Effective k-Links., , , , и . DS, том 12323 из Lecture Notes in Computer Science, стр. 421-436. Springer, (2020)High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix., и . COMPLEX NETWORKS, том 1016 из Studies in Computational Intelligence, стр. 536-548. Springer, (2021)