Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 211 matches
- 2023
- Takayasu Fushimi, Kazumi Saito, Hiroshi Motoda:
Constructing outlier-free histograms with variable bin-width based on distance minimization. Intell. Data Anal. 27(1): 5-29 (2023) - 2022
- Takayasu Fushimi, Kazumi Saito, Hiroshi Motoda:
Efficient computation of expected motif frequency in uncertain graphs by exploiting possible world marginalization and motif transition. Soc. Netw. Anal. Min. 12(1): 126 (2022) - 2021
- 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) - 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) - Takayasu Fushimi, Kazumi Saito, Hiroshi Motoda:
Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network. ASONAM 2021: 1-8 - 2020
- 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) - 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 - 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 - 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
- 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) - 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 - 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
- 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) - 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) - 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 - Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Critical Link Identification Based on Bridge Detection for Network with Uncertain Connectivity. ISMIS 2018: 89-99 - 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
- 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 - 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 - 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
- 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) - 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) - Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Accelerating Computation of Distance Based Centrality Measures for Spatial Networks. DS 2016: 376-391 - Minsoo Choy, Daehoon Kim, Jae-Gil Lee, Heeyoung Kim, Hiroshi Motoda:
Looking back on the current day: interruptibility prediction using daily behavioral features. UbiComp 2016: 1004-1015 - Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Detecting Critical Links in Complex Network to Maintain Information Flow/Reachability. PRICAI 2016: 419-432 - 2015
- 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) - 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 - Kouzou Ohara, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda:
Change Point Detection for Information Diffusion Tree. Discovery Science 2015: 161-169 - 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 - Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda:
Efficient Learning of User Conformity on Review Score. SBP 2015: 182-192
skipping 181 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-26 09:52 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint