( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Extracting the multilevel communities based on network structural and nonstructural information.

, , и . WWW (Companion Volume), стр. 191-192. International World Wide Web Conferences Steering Committee / ACM, (2013)

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.

Harumi Murata

Tsuyoshi Takagi

Hiroshi Murata

Tsuyoshi Matsuda

Christine Moll-Murata

 

Weitere Publikationen von Autoren mit dem selben Namen

Discovering and Visualizing Network Communities., und . Web Intelligence/IAT Workshops, Seite 217-220. IEEE Computer Society, (2007)Fast Optimization of Hamiltonian for Constrained Community Detection., und . CompleNet, Volume 597 von Studies in Computational Intelligence, Seite 79-89. Springer, (2015)Roles of Diagrammatic Information for the Discovery of Geometrical Theorems.. Diagrams, Volume 2980 von Lecture Notes in Computer Science, Seite 235-238. Springer, (2004)Discovery of Web Communities Based on the Co-Occurence of References.. Discovery Science, Volume 1967 von Lecture Notes in Computer Science, Seite 65-75. Springer, (2000)Towards Robust Compressed Convolutional Neural Networks., , , und . BigComp, Seite 1-8. IEEE, (2019)Modularity-based selection of the number of slices in temporal network clustering., , , , , und . CoRR, (2023)A method of inductive machine discovery based on experimental data acquisition., und . Syst. Comput. Jpn., 32 (4): 69-75 (2001)Modularity for Bipartite Networks.. Data Mining for Social Network Data, Volume 12 von Annals of Information Systems, Springer, (2010)An Efficient Algorithm for Optimizing Bipartite Modularity in Bipartite Networks., und . J. Adv. Comput. Intell. Intell. Informatics, 14 (4): 408-415 (2010)Breaking News Detection and Tracking in Twitter., und . Web Intelligence/IAT Workshops, Seite 120-123. IEEE Computer Society, (2010)978-0-7695-4191-4.