Skip to main content

and
  1. Article

    Open Access

    Estimating node connectedness in spatial network under stochastic link disconnection based on efficient sampling

    Many networks including spatial networks, social networks, and web networks, are not deterministic but probabilistic due to the uncertainty of link existence. From networks

    Takayasu Fushimi, Kazumi Saito, Tetsuo Ikeda, Kazuhiro Kazama in Applied Network Science (2019)

  2. No Access

    Chapter and Conference Paper

    A New Group Centrality Measure for Maximizing the Connectedness of Network Under Uncertain Connectivity

    In this paper, we propose a new centrality measure for the purpose of estimating and recommending installation sites of evacuation facilities that many residents can reach even in the situation where roads are...

    Takayasu Fushimi, Kazumi Saito, Tetsuo Ikeda in Complex Networks and Their Applications VII (2019)

  3. Article

    Open Access

    Improving approximate extraction of functional similar regions from large-scale spatial networks based on greedy selection of representative nodes of different areas

    Dividing a geographical region into some subregions with common characteristics is an important research topic, and has been studied in many research fields such as urban planning and transportation planning. ...

    Takayasu Fushimi, Kazumi Saito, Tetsuo Ikeda, Kazuhiro Kazama in Applied Network Science (2018)

  4. No Access

    Chapter and Conference Paper

    Fast Extraction Method of Functional Clusters from Large-Scale Spatial Networks Based on Transfer Learning

    In this paper, we treat the road network of each city as a network and attempt to accelerate extracting functional clusters which means areas that perform similar functions in road network. As a method of extr...

    Takayasu Fushimi, Kazumi Saito, Tetsuo Ikeda in Complex Networks & Their Applications VI (2018)

  5. No Access

    Chapter

    Acceleration of Functional Cluster Extraction and Analysis of Cluster Affinity

    Each chapter should be preceded by an abstract (10–15 lines long) that summarizes the content. The abstract will appear online at www.SpringerLink.com and be avail...

    Takayasu Fushimi, Kazumi Saito, Tetsuo Ikeda in Machine Learning Techniques for Online Soc… (2018)

  6. No Access

    Chapter and Conference Paper

    Accelerating Greedy K-Medoids Clustering Algorithm with \(L_1\) Distance by Pivot Generation

    With the explosive increase of multimedia objects represented as high-dimensional vectors, clustering techniques for these objects have received much attention in recent years. However, clustering methods usua...

    Takayasu Fushimi, Kazumi Saito, Tetsuo Ikeda in Foundations of Intelligent Systems (2017)

  7. No Access

    Chapter and Conference Paper

    Content Centrality Measure for Networks: Introducing Distance-Based Decay Weights

    We propose a novel centrality measure that is called Content Centrality for a given network that considers the feature vector of each node generated from its posting activities in social media, its own propert...

    Takayasu Fushimi, Tetsuji Satoh, Kazumi Saito, Kazuhiro Kazama in Social Informatics (2016)

  8. No Access

    Chapter and Conference Paper

    MDSR: An Eigenvector Approach to Core Analysis of Multiple Directed Graphs

    In this paper, we address a problem of extracting core portions of a network represented as a multiple directed graph. For this purpose, we propose a new core extraction method called MDSR (Multiple-Directed-S...

    Shoko Kato, Kazumi Saito, Kazuhiro Kazama in PRICAI 2014: Trends in Artificial Intellig… (2014)

  9. No Access

    Chapter and Conference Paper

    Estimating Network Structure from Anonymous Ego-centric Information

    We address a problem of estimating the whole structure of an actual social network of people from only their two types of anonymous ego-centric information, personal attributes like sex and relational ones lik...

    Takayasu Fushimi, Kazumi Saito in Knowledge Management and Acquisition for S… (2014)

  10. No Access

    Chapter and Conference Paper

    Extracting Communities in Networks Based on Functional Properties of Nodes

    We address the problem of extracting the groups of functionally similar nodes from a network. As functional properties of nodes, we focus on hierarchical levels, relative locations and/or roles with respect to...

    Takayasu Fushimi, Kazumi Saito in Knowledge Management and Acquisition for I… (2012)

  11. No Access

    Chapter

    The k-Dense Method to Extract Communities from Complex Networks

    To understand the structural and functional properties of large-scale complex networks, it is crucial to efficiently extract a set of cohesive subnetworks as communities. There have been proposed several such ...

    Kazumi Saito, Takeshi Yamada, Kazuhiro Kazama in Mining Complex Data (2009)

  12. No Access

    Chapter and Conference Paper

    Evaluation of Using Human Relationships on the Web as Information Navigation Paths

    We investigated the use of human relationships on the web for information navigation paths. We propose a new information navigation method that uses personal names. It automatically extracts the human relation...

    Kazuhiro Kazama, Shin-ya Sato, Kensuke Fukuda in New Frontiers in Artificial Intelligence (2006)

  13. No Access

    Chapter and Conference Paper

    Detecting Search Engine Spam from a Trackback Network in Blogspace

    We aim to develop a technique to detect search engine optimization (SEO) spam websites. Specifically, we propose four methods for extracting the SEO spam entries from a given trackback network in blogspace tha...

    Masahiro Kimura, Kazumi Saito in Knowledge-Based Intelligent Information an… (2005)