Seguir
Atsushi Miyauchi
Atsushi Miyauchi
CENTAI Institute
Dirección de correo verificada de centai.eu - Página principal
Título
Citado por
Citado por
Año
Z-score-based modularity for community detection in networks
A Miyauchi, Y Kawase
PloS one 11 (1), e0147805, 2016
422016
Hypergraph clustering based on pagerank
Y Takai, A Miyauchi, M Ikeda, Y Yoshida
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge …, 2020
412020
The densest subgraph problem with a convex/concave size function
Y Kawase, A Miyauchi
Algorithmica 80, 3461-3480, 2018
352018
Redundant constraints in the standard formulation for the clique partitioning problem
A Miyauchi, N Sukegawa
Optimization Letters 9 (1), 199-207, 2015
312015
Exact clustering via integer programming and maximum satisfiability
A Miyauchi, T Sonobe, N Sukegawa
Proceedings of the AAAI conference on artificial intelligence 32 (1), 2018
242018
Maximizing Barber’s bipartite modularity is also hard
A Miyauchi, N Sukegawa
Optimization Letters 9, 897-913, 2015
242015
Graph mining meets crowdsourcing: Extracting experts for answer aggregation
Y Kawase, Y Kuroki, A Miyauchi
arXiv preprint arXiv:1905.08088, 2019
222019
Threshold influence model for allocating advertising budgets
A Miyauchi, Y Iwamasa, T Fukunaga, N Kakimura
International Conference on Machine Learning, 1395-1404, 2015
222015
Polynomial-time algorithms for multiple-arm identification with full-bandit feedback
Y Kuroki, L Xu, A Miyauchi, J Honda, M Sugiyama
Neural Computation 32 (9), 1733-1773, 2020
21*2020
Finding Cheeger cuts in hypergraphs via heat equation
M Ikeda, A Miyauchi, Y Takai, Y Yoshida
arXiv preprint arXiv:1809.04396, 2018
21*2018
Finding a dense subgraph with sparse cut
A Miyauchi, N Kakimura
Proceedings of the 27th ACM International Conference on Information and …, 2018
192018
Computing an upper bound of modularity
A Miyauchi, Y Miyamoto
The European Physical Journal B 86, 1-7, 2013
192013
What is a network community? A novel quality function and detection algorithms
A Miyauchi, Y Kawase
Proceedings of the 24th ACM international on conference on information and …, 2015
172015
Finding densest k-connected subgraphs
F Bonchi, D García-Soriano, A Miyauchi, CE Tsourakakis
Discrete Applied Mathematics 305, 34-47, 2021
162021
Online dense subgraph discovery via blurred-graph feedback
Y Kuroki, A Miyauchi, J Honda, M Sugiyama
International Conference on Machine Learning, 5522-5532, 2020
152020
Robust densest subgraph discovery
A Miyauchi, A Takeda
2018 IEEE International Conference on Data Mining (ICDM), 1188-1193, 2018
152018
A survey on the densest subgraph problem and its variants
T Lanciano, A Miyauchi, A Fazzone, F Bonchi
ACM Computing Surveys, 2023
142023
Additive approximation algorithms for modularity maximization
Y Kawase, T Matsui, A Miyauchi
Journal of Computer and System Sciences 117, 182-201, 2021
122021
Fractional programming formulation for the vertex coloring problem
T Matsui, N Sukegawa, A Miyauchi
Information Processing Letters 114 (12), 706-709, 2014
82014
Stochastic solutions for dense subgraph discovery in multilayer networks
Y Kawase, A Miyauchi, H Sumita
Proceedings of the Sixteenth ACM International Conference on Web Search and …, 2023
52023
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20