MJMingshan Jia

Mingshan Jia

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mingshan Jia has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Fuzzy-LFS: A Novel Localized Feature Selection With Fuzzy Region Division and Local Neighborhood Rough Set for Classification

    by Jieyu Huang, Yu Zhou, Mingshan Jia, Guanghua Lyu, Qingfu Zhang, Sam Kwong

    Localized feature selection (LFS) methods divide the whole sample space to determine region-specific subsets for classification which outperform traditional feature selection with a global feature subset for the entire sample space. However, existing LFS algorithms decompose the local regions by impurity level of samples, which can misplace critical samples and impair feature selection results. To tackle this issue, this paper proposes a novel Fuzzy Localized Feature Selection (Fuzzy-LFS) algorithm, which divides local regions around each sample based on Gaussian fuzzy membership to enhance the coherence of region-specific information. Besides, to handle data fuzziness and uncertainty, Fuzzy-LFS establishes a Local Neighborhood Rough Set Model with forward greedy optimization to search the feature subsets. A novel local classifier is subsequently developed, overcoming the limitations of global classifiers unsuited for LFS while mitigating the excessive dependency on impurity level in traditional local classifiers. Specifically, for high-dimensional datasets, we introduce a Localized Feature Relevance Pre-Selection strategy, assigning sample-specific feature subsets according to local relevance to assist in dividing local regions and enhance classification performance. Through comprehensive experiments on 11 low-dimensional and 13 high-dimensional datasets, Fuzzy-LFS achieves superior classification accuracy to state-of-the-art LFS methods, demonstrating its effectiveness.


  • Open Access

    Network disruption via continuous batch removal: The case of Sicilian Mafia

    by Mingshan Jia, Pasquale De Meo, Bogdan Gabrys, Katarzyna Musial

    Network disruption is pivotal in understanding the robustness and vulnerability of complex networks, which is instrumental in devising strategies for infrastructure protection, epidemic control, cybersecurity, and combating crime. In this paper, with a particular focus on disrupting criminal networks, we proposed to impose a within-the-largest-connected-component constraint in a continuous batch removal disruption process. Through a series of experiments on a recently released Sicilian Mafia network, we revealed that the constraint would enhance degree-based methods while weakening betweenness-based approaches. Moreover, based on the findings from the experiments using various disruption strategies, we propose a structurally-filtered greedy disruption strategy that integrates the effectiveness of greedy-like methods with the efficiency of structural-metric-based approaches. The proposed strategy significantly outperforms the longstanding state-of-the-art method of betweenness centrality while maintaining the same time complexity.


  • Open Access

    Network Disruption via Continuous Batch Removal: The Case of Sicilian Mafia

    by Mingshan Jia, Pasquale De Meo, Bogdan Gabrys, Katarzyna Musial

    Network disruption is pivotal in understanding the robustness and vulnerability of complex networks, which is instrumental in devising strategies for infrastructure protection, epidemic control, cybersecurity, and combating crime. In this paper, with a particular focus on disrupting criminal networks, we proposed to impose a within-the-largest-connected-component constraint in a continuous batch removal disruption process. Through a series of experiments on a recently released Sicilian Mafia network, we revealed that the constraint would enhance degree-based methods while weakening betweenness-based approaches. Moreover, based on the findings from the experiments using various disruption strategies, we propose a structurally-filtered greedy disruption strategy that integrates the effectiveness of greedy-like methods with the efficiency of structural-metric-based approaches. The proposed strategy significantly outperforms the longstanding state-of-the-art method of betweenness centrality while maintaining the same time complexity.

  • Open Access

    A Network Science Perspective of Graph Convolutional Networks: A Survey

    by Mingshan Jia, Bogdan Gabrys, Katarzyna Musial

    The mining and exploitation of graph structural information have been the focal points in the study of complex networks. Traditional structural measures in Network Science focus on the analysis and modelling of complex networks from the perspective of network structure, such as the centrality measures, the clustering coefficient, and motifs and graphlets, and they have become basic tools for studying and understanding graphs. In comparison, graph neural networks, especially graph convolutional networks (GCNs), are particularly effective at integrating node features into graph structures via neighbourhood aggregation and message passing, and have been shown to significantly improve the performances in a variety of learning tasks. These two classes of methods are, however, typically treated separately with limited references to each other. In this work, aiming to establish relationships between them, we provide a network science perspective of GCNs. Our novel taxonomy classifies GCNs from three structural information angles, i.e., the layer-wise message aggregation scope, the message content, and the overall learning scope. Moreover, as a prerequisite for reviewing GCNs via a network science perspective, we also summarise traditional structural measures and propose a new taxonomy for them. Finally and most importantly, we draw connections between traditional structural approaches and graph convolutional networks, and discuss potential directions for future research.


  • Open Access

    Encoding edge type information in graphlets

    by Mingshan Jia, Maité Van Alboom, Liesbet Goubert, Piet Bracke, Bogdan Gabrys, Katarzyna Musial

    Graph embedding approaches have been attracting increasing attention in recent years mainly due to their universal applicability. They convert network data into a vector space in which the graph structural information and properties are maximumly preserved. Most existing approaches, however, ignore the rich information about interactions between nodes, i.e., edge attribute or edge type. Moreover, the learned embeddings suffer from a lack of explainability, and cannot be used to study the effects of typed structures in edge-attributed networks. In this paper, we introduce a framework to embed edge type information in graphlets and generate a Typed-Edge Graphlets Degree Vector (TyE-GDV). Additionally, we extend two combinatorial approaches, i.e., the colored graphlets and heterogeneous graphlets approaches to edge-attributed networks. Through applying the proposed method to a case study of chronic pain patients, we find that not only the network structure of a patient could indicate his/her perceived pain grade, but also certain social ties, such as those with friends, colleagues, and healthcare professionals, are more crucial in understanding the impact of chronic pain. Further, we demonstrate that in a node classification task, the edge-type encoded graphlets approaches outperform the traditional graphlet degree vector approach by a significant margin, and that TyE-GDV could achieve a competitive performance of the combinatorial approaches while being far more efficient in space requirements.


  • Analysing Ego-Networks via Typed-Edge Graphlets: A Case Study of Chronic Pain Patients

    by Mingshan Jia, Maité Van Alboom, Liesbet Goubert, Piet Bracke, Bogdan Gabrys, Katarzyna Musial


  • Measuring Quadrangle Formation in Complex Networks

    by Mingshan Jia, Bogdan Gabrys, Katarzyna Musial

    The classic clustering coefficient and the lately proposed closure coefficient quantify the formation of triangles from two different perspectives, with the focal node at the centre or at the end in an open triad respectively. As many networks are naturally rich in triangles, they become standard metrics to describe and analyse networks. However, the advantages of applying them can be limited in networks, where there are relatively few triangles but which are rich in quadrangles, such as the protein-protein interaction networks, the neural networks and the food webs. This yields for other approaches that would leverage quadrangles in our journey to better understand local structures and their meaning in different types of networks. Here we propose two quadrangle coefficients, i.e., the i-quad coefficient and the o-quad coefficient, to quantify quadrangle formation in networks, and we further extend them to weighted networks. Through experiments on 16 networks from six different domains, we first reveal the density distribution of the two quadrangle coefficients, and then analyse their correlations with node degree. Finally, we demonstrate that at network-level, adding the average i-quad coefficient and the average o-quad coefficient leads to significant improvement in network classification, while at node-level, the i-quad and o-quad coefficients are useful features to improve link prediction.


  • Open Access

    Directed closure coefficient and its patterns

    by Mingshan Jia, Bogdan Gabrys, Katarzyna Musial

    The triangle structure, being a fundamental and significant element, underlies many theories and techniques in studying complex networks. The formation of triangles is typically measured by the clustering coefficient, in which the focal node is the centre-node in an open triad. In contrast, the recently proposed closure coefficient measures triangle formation from an end-node perspective and has been proven to be a useful feature in network analysis. Here, we extend it by proposing the directed closure coefficient that measures the formation of directed triangles. By distinguishing the direction of the closing edge in building triangles, we further introduce the source closure coefficient and the target closure coefficient. Then, by categorising particular types of directed triangles (e.g., head-of-path), we propose four closure patterns. Through multiple experiments on 24 directed networks from six domains, we demonstrate that at network-level, the four closure patterns are distinctive features in classifying network types, while at node-level, adding the source and target closure coefficients leads to significant improvement in link prediction task in most types of directed networks.


  • Closure Coefficient in Complex Directed Networks

    by Mingshan Jia, Bogdan Gabrys, Katarzyna Musial


  • Open Access

    Measuring Quadrangle Formation in Complex Networks

    by Mingshan Jia, Bogdan Gabrys, Katarzyna Musial

    The classic clustering coefficient and the lately proposed closure coefficient quantify the formation of triangles from two different perspectives, with the focal node at the centre or at the end in an open triad respectively. As many networks are naturally rich in triangles, they become standard metrics to describe and analyse networks. However, the advantages of applying them can be limited in networks, where there are relatively few triangles but which are rich in quadrangles, such as the protein-protein interaction networks, the neural networks and the food webs. This yields for other approaches that would leverage quadrangles in our journey to better understand local structures and their meaning in different types of networks. Here we propose two quadrangle coefficients, i.e., the i-quad coefficient and the o-quad coefficient, to quantify quadrangle formation in networks, and we further extend them to weighted networks. Through experiments on 16 networks from six different domains, we first reveal the density distribution of the two quadrangle coefficients, and then analyse their correlations with node degree. Finally, we demonstrate that at network-level, adding the average i-quad coefficient and the average o-quad coefficient leads to significant improvement in network classification, while at node-level, the i-quad and o-quad coefficients are useful features to improve link prediction.