Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasahiro Kimura
- > Home > Persons > Masahiro Kimura
Publications
- 2021
[j23]Kazumi Saito, Takayasu Fushimi, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Efficient computation of target-oriented link criticalness centrality in uncertain graphs. Intell. Data Anal. 25(5): 1323-1343 (2021)- [j22]Takayasu Fushimi
, Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
General framework of opening and closing shops over a spatial network based on stochastic utility under competitive and time-bounded environment. Soc. Netw. Anal. Min. 11(1): 70 (2021) - 2020
- [j21]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Resampling-based predictive simulation framework of stochastic diffusion model for identifying top-K influential nodes. Int. J. Data Sci. Anal. 9(2): 175-195 (2020) - [c84]Takayasu Fushimi, Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Opening and Closing Dynamics of Competing Shop Groups over Spatial Networks. ASONAM 2020: 393-400 - [c83]Takayasu Fushimi, Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Efficient Computing of PageRank Scores on Exact Expected Transition Matrix of Large Uncertain Graph. IEEE BigData 2020: 916-923 - [c81]Kouzou Ohara, Takayasu Fushimi, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Maximizing Network Coverage Under the Presence of Time Constraint by Injecting Most Effective k-Links. DS 2020: 421-436 - 2019
- [j20]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Critical Node Identification based on Articulation Point Detection for Uncertain Network. Int. J. Netw. Comput. 9(2): 201-216 (2019) - [c79]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Resampling-Based Framework for Unbiased Estimator of Node Centrality over Large Complex Network. DS 2019: 428-442 - [c78]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Efficient Identification of Critical Links Based on Reachability Under the Presence of Time Constraint. PRICAI (2) 2019: 404-418 - 2018
- [j18]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Which is more influential, "Who" or "When" for a user to rate in online review site? Intell. Data Anal. 22(3): 639-657 (2018) - [j17]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Accurate and efficient detection of critical links in network to minimize information loss. J. Intell. Inf. Syst. 51(2): 235-255 (2018) - [c77]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Critical Node Identification Based on Articulation Point Detection for Network with Uncertain Connectivity. CANDAR 2018: 146-152 - [c76]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Critical Link Identification Based on Bridge Detection for Network with Uncertain Connectivity. ISMIS 2018: 89-99 - [c74]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Efficient Detection of Critical Links to Maintain Performance of Network with Uncertain Connectivity. PRICAI (1) 2018: 282-295 - 2017
- [c73]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Maximizing Network Performance Based on Group Centrality by Creating Most Effective k-Links. DSAA 2017: 561-570 - [c71]Kanji Matsutani, Masahito Kumano, Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Discovering Cooperative Structure Among Online Items for Attention Dynamics. ICDM Workshops 2017: 1033-1041 - [c70]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
An Accurate and Efficient Method to Detect Critical Links to Maintain Information Flow in Network. ISMIS 2017: 116-126 - 2016
- [j16]Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Speeding-up node influence computation for huge social networks. Int. J. Data Sci. Anal. 1(1): 3-16 (2016) - [j15]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Super mediator - A new centrality measure of node importance for information diffusion over social network. Inf. Sci. 329: 985-1000 (2016) - [c69]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Accelerating Computation of Distance Based Centrality Measures for Spatial Networks. DS 2016: 376-391 - [c67]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Detecting Critical Links in Complex Network to Maintain Information Flow/Reachability. PRICAI 2016: 419-432 - 2015
- [j14]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Change point detection for burst analysis from an observed information diffusion sequence of tweets. J. Intell. Inf. Syst. 44(2): 243-269 (2015) - [c66]Kanji Matsutani, Masahito Kumano, Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Combining activity-evaluation information with NMF for trust-link prediction in social media. IEEE BigData 2015: 2263-2272 - [c65]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Change Point Detection for Information Diffusion Tree. Discovery Science 2015: 161-169 - [c62]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Resampling-Based Gap Analysis for Detecting Nodes with High Centrality on Large Social Network. PAKDD (1) 2015: 135-147 - [c61]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Efficient Learning of User Conformity on Review Score. SBP 2015: 182-192 - 2014
- [c60]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Resampling-Based Framework for Estimating Node Centrality of Large Social Network. Discovery Science 2014: 228-239 - [c59]Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Efficient analysis of node influence based on SIR model over huge complex networks. DSAA 2014: 216-222 - [c58]Keito Hatta, Masahito Kumano, Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Analyzing Mediator-Activity Effects for Trust-Network Evolution in Social Media. PRICAI 2014: 297-308 - [c57]Yuki Yamagishi, Seiya Okubo, Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
A Method to Divide Stream Data of Scores over Review Sites. PRICAI 2014: 913-919 - [c56]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
A New Approach for Item Ranking Based on Review Scores Reflecting Temporal Trust Factor. SBP 2014: 161-168 - 2013
- [j13]Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Learning to predict opinion share and detect anti-majority opinionists in social networks. J. Intell. Inf. Syst. 41(1): 5-37 (2013) - [j12]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Detecting changes in information diffusion patterns over social networks. ACM Trans. Intell. Syst. Technol. 4(3): 55:1-55:23 (2013) - [c55]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Predictive Simulation Framework of Stochastic Diffusion Model for Identifying Top-K Influential Nodes. ACML 2013: 149-164 - [c54]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Detecting changes in content and posting time distributions in social media. ASONAM 2013: 572-578 - [c52]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Identifying Super-Mediators of Information Diffusion in Social Networks. Discovery Science 2013: 170-184 - [c51]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Which Targets to Contact First to Maximize Influence over Social Network. SBP 2013: 359-367 - 2012
- [j11]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Efficient discovery of influential nodes for SIS models in social networks. Knowl. Inf. Syst. 30(3): 613-635 (2012) - [c49]Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Burst Detection in a Sequence of Tweets Based on Information Diffusion Model. Discovery Science 2012: 239-253 - [c47]Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Opinion Formation by Voter Model with Temporal Decay Dynamics. ECML/PKDD (2) 2012: 565-580 - [c46]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Effect of In/Out-Degree Correlation on Influence Degree of Two Contrasting Information Diffusion Models. SBP 2012: 131-138 - [c44]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Graph embedding on spheres and its application to visualization of information diffusion data. WWW (Companion Volume) 2012: 1137-1144 - [i2]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Learning Asynchronous-Time Information Diffusion Models and its Application to Behavioral Data Analysis over Social Networks. CoRR abs/1204.4528 (2012) - 2011
- [j10]Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Learning information diffusion model in a social network for predicting influence of nodes. Intell. Data Anal. 15(4): 633-652 (2011) - [c43]Takayasu Fushimi, Yamato Kubota, Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Speeding Up Bipartite Graph Visualization Method. Australasian Conference on Artificial Intelligence 2011: 697-706 - [c42]Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Detecting Anti-majority Opinionists Using Value-Weighted Mixture Voter Model. Discovery Science 2011: 150-164 - [c41]Kazumi Saito, Kouzou Ohara, Yuki Yamagishi, Masahiro Kimura, Hiroshi Motoda:
Learning Diffusion Probability Based on Node Attributes in Social Networks. ISMIS 2011: 153-162 - [c40]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Detecting Changes in Opinion Value Distribution for Voter Model. SBP 2011: 89-96 - [c39]Yuki Yamagishi, Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Learning Attribute-weighted Voter Model over Social Networks. ACML 2011: 263-280 - [c38]Akihiro Koide, Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Estimating Diffusion Probability Changes for AsIC-SIS Model. ACML 2011: 297-313 - [i1]Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Efficient Detection of Hot Span in Information Diffusion from Observation. CoRR abs/1110.2659 (2011) - 2010
- [j9]Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiroshi Motoda:
Extracting influential nodes on a social network for information diffusion. Data Min. Knowl. Discov. 20(1): 70-97 (2010) - [c37]Masahiro Kimura, Kazumi Saito, Kouzou Ohara, Hiroshi Motoda:
Learning to Predict Opinion Share in Social Networks. AAAI 2010: 1364-1370 - [c36]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Discovery of Super-Mediators of Information Diffusion in Social Networks. Discovery Science 2010: 144-158 - [c35]Takayasu Fushimi, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda, Kouzou Ohara:
Finding Relation between PageRank and Voter Model. PKAW 2010: 208-222 - [c34]Yuya Yoshikawa, Kazumi Saito, Hiroshi Motoda, Kouzou Ohara, Masahiro Kimura:
Acquiring Expected Influence Curve from Single Diffusion Sequence. PKAW 2010: 273-287 - [c33]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Selecting Information Diffusion Models over Social Networks for Behavioral Analysis. ECML/PKDD (3) 2010: 180-195 - [c32]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Efficient Estimation of Cumulative Influence for Multiple Activation Information Diffusion Model with Continuous Time Delay. PRICAI 2010: 244-255 - [c31]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Behavioral Analyses of Information Diffusion Models by Observed Data of Social Network. SBP 2010: 149-158 - [c30]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Generative Models of Information Diffusion with Asynchronous Timedelay. ACML 2010: 193-208 - 2009
- [j8]Masahiro Kimura, Kazumi Saito, Hiroshi Motoda:
Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data 3(2): 9:1-9:23 (2009) - [c29]Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Learning Continuous-Time Information Diffusion Model for Social Behavioral Data Analysis. ACML 2009: 322-337 - [c28]Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Discovering Influential Nodes for SIS Models in Social Networks. Discovery Science 2009: 302-316 - [c26]Masahiro Kimura, Kazumi Saito, Hiroshi Motoda:
Efficient Estimation of Influence Functions for SIS Model on Social Networks. IJCAI 2009: 2046-2051 - [c25]Ken-ichi Fukui, Kazuhisa Sato, Junichiro Mizusaki, Kazumi Saito, Masahiro Kimura, Masayuki Numao:
Growth Analysis of Neighbor Network for Evaluation of Damage Progress. PAKDD 2009: 933-940 - 2008
- [c24]Ken-ichi Fukui, Kazumi Saito, Masahiro Kimura, Masayuki Numao:
Sequence-based SOM: Visualizing transition of dynamic clusters. CIT 2008: 47-52 - [c23]Masahiro Kimura, Kazumi Saito, Hiroshi Motoda:
Minimizing the Spread of Contamination by Blocking Links in a Network. AAAI 2008: 1175-1180 - [c21]Masahiro Kimura, Kazumasa Yamakawa, Kazumi Saito, Hiroshi Motoda:
Community analysis of influential nodes for information diffusion on a social network. IJCNN 2008: 1358-1363 - [c20]Kazumi Saito, Ryohei Nakano, Masahiro Kimura:
Prediction of Information Diffusion Probabilities for Independent Cascade Model. KES (3) 2008: 67-75 - [c19]Takayasu Fushimi, Takashi Kawazoe, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
What Does an Information Diffusion Model Tell about Social Network Structure?. PKAW 2008: 122-136 - [c18]Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Effective Visualization of Information Diffusion Process over Complex Networks. ECML/PKDD (2) 2008: 326-341 - [c17]Masahiro Kimura, Kazumi Saito, Hiroshi Motoda:
Solving the Contamination Minimization Problem on Networks for the Linear Threshold Model. PRICAI 2008: 977-984 - 2007
- [c16]Masahiro Kimura, Kazumi Saito, Ryohei Nakano:
Extracting Influential Nodes for Information Diffusion on a Social Network. AAAI 2007: 1371-1376 - [c14]Ken-ichi Fukui, Kazumi Saito, Masahiro Kimura, Masayuki Numao:
Interpretable Likelihood for Vector Representable Topic. KES (3) 2007: 202-209 - [c13]Kazumi Saito, Ryohei Nakano, Masahiro Kimura:
Prediction of Link Attachments by Estimating Probabilities of Information Propagation. KES (3) 2007: 235-242 - 2006
- [c11]Ken-ichi Fukui, Kazumi Saito, Masahiro Kimura, Masayuki Numao:
Visualization Architecture Based on SOM for Two-Class Sequential Data. KES (2) 2006: 929-936 - [c10]Masahiro Kimura, Kazumi Saito:
Approximate Solutions for the Influence Maximization Problem in a Social Network. KES (2) 2006: 937-944 - [c9]Masahiro Kimura, Kazumi Saito:
Tractable Models for Information Diffusion in Social Networks. PKDD 2006: 259-271 - 2005
- [c8]Masahiro Kimura, Kazumi Saito, Kazuhiro Kazama, Shin-ya Sato:
Detecting Search Engine Spam from a Trackback Network in Blogspace. KES (4) 2005: 723-729 - [c7]Ken-ichi Fukui, Kazumi Saito, Masahiro Kimura, Masayuki Numao:
Visualizing Dynamics of the Hot Topics Using Sequence-Based Self-organizing Maps. KES (4) 2005: 745-751 - 2004
- [j7]Masahiro Kimura, Kazumi Saito, Naonori Ueda:
Modeling of growing networks with directional attachment and communities. Neural Networks 17(7): 975-988 (2004) - [j6]Masahiro Kimura, Kazumi Saito, Naonori Ueda:
Modeling network growth with directional attachment and communities. Syst. Comput. Jpn. 35(8): 1-11 (2004) - 2003
- [c6]Masahiro Kimura, Kazumi Saito, Naonori Ueda:
Modeling of growing networks with directional attachment and communities. ESANN 2003: 15-20 - 2002
- [c5]Masahiro Kimura, Kazumi Saito, Naonori Ueda:
Modeling of growing networks with communities. NNSP 2002: 189-198
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-16 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
