Xiangnan Kong’s research while affiliated with Worcester Polytechnic Institute and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (147)


Recurrent Networks for Guided Multi-Attention Classification
  • Conference Paper

August 2020

·

21 Reads

·

5 Citations

·

Xiangnan Kong

·

·

[...]

·


Off-Deployment Traffic Estimation --- A Traffic Generative Adversarial Networks Approach

August 2020

·

33 Reads

·

10 Citations

IEEE Transactions on Big Data

The rapid progress of urbanization has expedited the process of urban planning, e.g. , new residential, commercial areas, which in turn boosts the local travel demand. We propose a novel “off-deployment traffic estimation problem”, namely, to foresee the traffic condition changes of a region prior to the deployment of a construction plan. This problem is important to city planners to evaluate and develop urban deployment plans. However, this task is challenging. Traditional traffic estimation approaches lack the ability to solve this problem, since no data about the impact can be collected before the deployment and old data fails to capture the traffic pattern changes. In this paper, we define the off-deployment traffic estimation problem as a traffic generation problem, and develop a novel deep generative model TrafficGAN that captures the shared patterns across spatial regions of how traffic conditions evolve according to travel demand changes and underlying road network structures. In particular, TrafficGAN captures the road network structures through a dynamic filter in the dynamic convolutional layer. We evaluate our TrafficGAN using a large-scale traffic data collected from Shenzhen, China. Results show that TrafficGAN can more accurately estimate the traffic conditions compared with all baselines. We also showcase that TrafficGAN can identify potential traffic issues in some regions and suggest possible reasons.


Role-Based Graph Embeddings

July 2020

·

65 Reads

·

102 Citations

IEEE Transactions on Knowledge and Data Engineering

Random walks are at the heart of many existing node embedding and network representation learning methods. However, such methods have many limitations that arise from the use of traditional random walks, e.g., the embeddings resulting from these methods capture proximity (communities) among the vertices as opposed to structural similarity (roles). Furthermore, the embeddings are unable to transfer to new nodes and graphs as they are tied to node identity. To overcome these limitations, we introduce the Role2Vec framework based on the proposed notion of attributed random walks to learn structural role-based embeddings. Notably, the framework serves as a basis for generalizing any walk-based method. The Role2Vec framework enables these methods to be more widely applicable by learning inductive functions that capture the structural roles in the graph. Furthermore, the original methods are recovered as a special case of the framework when each vertex is mapped to its own function that uniquely identifies it. Finally, the Role2Vec framework is shown to be effective with an average AUC improvement of 17.8 percent for link prediction while requiring on average 853x less space than existing methods on a variety of graphs from different domains.


Figure 1: A toy example of attributed heterogeneous information network. A, P and C respectively denote authors, papers and conferences. The attributes of authors are their interest in research areas including network embedding, anomaly detection, NMF, and coclustering, while the attributes of conferences are topics such as clustering, topic modeling, and recommender systems.
Figure 3: The relevance of co-clustering on Aminer dataset with 10% constraints. Both authors and conferences are assigned into five groups. The deeper colored blocks denotes the higher relevance of clusters.
Figure 4: The NMI performance of SCCAIN(A), SCCAIN(L) and SCCAIN on co-clustering.
Figure 5: The NMI value of SCCAIN on Aminer dataset with different iterations.
Figure 6: The NMI value of SCCAIN on Aminer dataset with different α.

+2

Semi-supervised Co-Clustering on Attributed Heterogeneous Information Networks
  • Article
  • Full-text available

June 2020

·

61 Reads

·

9 Citations

Information Processing & Management

Node clustering on heterogeneous information networks (HINs) plays an important role in many real-world applications. While previous research mainly clusters same-type nodes independently via exploiting structural similarity search, they ignore the correlations of different-type nodes. In this paper, we focus on the problem of co-clustering heterogeneous nodes where the goal is to mine the latent relevance of heterogeneous nodes and simultaneously partition them into the corresponding type-aware clusters. This problem is challenging in two aspects. First, the similarity or relevance of nodes is not only associated with multiple meta-path-based structures but also related to numerical and categorical attributes. Second, clusters and similarity/relevance searches usually promote each other. To address this problem, we first design a learnable overall relevance measure that integrates the structural and attributed relevance by employing meta-paths and attribute projection. We then propose a novel approach, called SCCAIN, to co-cluster heterogeneous nodes based on constrained orthogonal non-negative matrix tri-factorization. Furthermore, an end-to-end framework is developed to jointly optimize the relevance measures and co-clustering. Extensive experiments on real-world datasets not only demonstrate that SCCAIN consistently outperforms state-of-the-art methods but also validate the effectiveness of integrating attributed and structural information for co-clustering.

Download





Heterogeneous network embedding enabling accurate disease association predictions

December 2019

·

199 Reads

·

26 Citations

BMC Medical Genomics

Background: It is significant to identificate complex biological mechanisms of various diseases in biomedical research. Recently, the growing generation of tremendous amount of data in genomics, epigenomics, metagenomics, proteomics, metabolomics, nutriomics, etc., has resulted in the rise of systematic biological means of exploring complex diseases. However, the disparity between the production of the multiple data and our capability of analyzing data has been broaden gradually. Furthermore, we observe that networks can represent many of the above-mentioned data, and founded on the vector representations learned by network embedding methods, entities which are in close proximity but at present do not actually possess direct links are very likely to be related, therefore they are promising candidate subjects for biological investigation. Results: We incorporate six public biological databases to construct a heterogeneous biological network containing three categories of entities (i.e., genes, diseases, miRNAs) and multiple types of edges (i.e., the known relationships). To tackle the inherent heterogeneity, we develop a heterogeneous network embedding model for mapping the network into a low dimensional vector space in which the relationships between entities are preserved well. And in order to assess the effectiveness of our method, we conduct gene-disease as well as miRNA-disease associations predictions, results of which show the superiority of our novel method over several state-of-the-arts. Furthermore, many associations predicted by our method are verified in the latest real-world dataset. Conclusions: We propose a novel heterogeneous network embedding method which can adequately take advantage of the abundant contextual information and structures of heterogeneous network. Moreover, we illustrate the performance of the proposed method on directing studies in biology, which can assist in identifying new hypotheses in biological investigation.



Citations (67)


... In the literature, related tasks in brain imaging analysis have been extensively studied. Conventional methods primarily focus on designing methods for brain extraction (Kleesiek et al. 2016;Lucena et al. 2019), registration (Sokooti et al. 2017;Su et al. 2022a), segmentation (Akkus et al. 2017;Kamnitsas et al. 2017;Chen et al. 2018), parcellation (Thyreau and Taki 2020;Lim et al. 2022Lim et al. ), network generation (Škoch et al. 2022Yin et al. 2023) and classification Kawahara et al. 2017;Kan et al. 2022b) separately under supervised settings. However, in brain imaging studies, the collection of voxel-level annotations, transformations between images, and task-specific brain networks often prove to be expensive, as it demands extensive expertise, effort, and time to produce accurate labels, especially for high-dimensional neuroimaging data, e.g., 3D MRI. ...

Reference:

End-to-End Deep Learning for Structural Brain Imaging: A Unified Framework
Multi-State Brain Network Discovery
  • Citing Conference Paper
  • December 2023

... In [14], the issue of maximizing multi-item influence in continuous settings is examined, taking into account situations in which various influencers are offered disparate incentives on various items to entice them to participate in the viral marketing process. The goal of the cluster greedy algorithm, which is covered in [15], is to maximize the influence by dividing the social network into clusters and choosing seed influencers in an effective manner by combining the basic greedy algorithm with an investigation of the sub modularity property of the diffusion function. In [16], a quantum computing strategy for influence maximization is examined with the goal of obtaining near-optimal solutions through the use of effective quadratic unconstrained binary optimization formulations on quantum annealer and the transformation of the influence maximization problem into a max-cover instance problem. ...

Multi-Item Continuous Influence Maximization
  • Citing Conference Paper
  • December 2023

... A study was conducted on capturing the interdependence of labels in multiple-label classification, where an example can be assigned multiple labels simultaneously. This study also demonstrated that effectively managing the complexities associated with labels necessitates the use of advanced techniques, particularly in cases where certain labels are limited or require additional contextual information for accurate classification [35]. Nevertheless, employing techniques like synthetic data generation has been demonstrated to improve the performance of the model when dealing with imbalanced and diverse labels. ...

Knowledge Amalgamation for Multi-Label Classification via Label Dependency Transfer
  • Citing Article
  • June 2023

Proceedings of the AAAI Conference on Artificial Intelligence

... MetaST [26] employs a global memory queried by the target region. Moreover, STrans-GAN [31] generates future trac speed using GANs, and TPB method [15] proposes a trac pattern bank to store similar patterns from multiple source cities for the downstream ne-tuning task. However, these methods heavily depend on data-rich multiple source cities, and can be cost-prohibitive in practice. ...

STrans-GAN: Spatially-Transferable Generative Adversarial Networks for Urban Traffic Estimation
  • Citing Conference Paper
  • November 2022

... In the literature, related tasks in brain imaging analysis have been extensively studied. Conventional methods primarily focus on designing methods for brain extraction (Kleesiek et al. 2016;Lucena et al. 2019), registration (Sokooti et al. 2017;Su et al. 2022a), segmentation (Akkus et al. 2017;Kamnitsas et al. 2017;Chen et al. 2018), parcellation (Thyreau and Taki 2020;Lim et al. 2022Lim et al. ), network generation (Škoch et al. 2022Yin et al. 2023) and classification Kawahara et al. 2017;Kan et al. 2022b) separately under supervised settings. However, in brain imaging studies, the collection of voxel-level annotations, transformations between images, and task-specific brain networks often prove to be expensive, as it demands extensive expertise, effort, and time to produce accurate labels, especially for high-dimensional neuroimaging data, e.g., 3D MRI. ...

ABN: Anti-Blur Neural Networks for Multi-Stage Deformable Image Registration
  • Citing Conference Paper
  • November 2022

... Early classification of time series [1,2,3,4] is a pivotal algorithm, especially when sampling cost is high, e.g., medical early diagnosis [5], autonomous driving [6], and action recognition [7]. Under these applications, the early classifier seeks to optimize both speed and accuracy at the same time. ...

Stop&Hop: Early Classification of Irregular Time Series
  • Citing Article
  • October 2022

... If prediction is triggered, the hidden representation given by the RNN is sent to a Discriminator, whose role is to predict a class, given this representation. The model has been adapted to deal with irregularly sampled time series [57]. [58] extend the ECTS framework to channel filtering, using here also Reinforcement Learning. ...

Stop&Hop: Early Classification of Irregular Time Series
  • Citing Conference Paper
  • October 2022

... Two types of neural networks with recurrent LSTM layers [9] and LSTNet [10] were built to predict electricity imbalances. After which two linear layers with hyperbolic tangent and sigmoid activation functions, respectively. ...

Semi-Supervised Knowledge Amalgamation for Sequence Classification
  • Citing Article
  • May 2021

Proceedings of the AAAI Conference on Artificial Intelligence

... Instead of tedious, step-by-step processing for brain imaging data, recent studies support transforming these pipelines into deep neural networks for joint learning and end-to-end optimization (Ren et al. 2024;Agarwal et al. 2022). While several approaches have been proposed-such as joint extraction and registration (Su et al. 2022b), joint registration and parcellation (Zhao et al. 2021;Lord et al. 2007), and joint network generation and disease prediction (Campbell et al. 2022;Mahmood et al. 2021;Kan et al. 2022a)-there is currently no framework that unifies and simultaneously optimizes all these processing stages to directly create brain networks from raw imaging data. Mapping the connectome of human brain as a brain network (i.e., graph), has become one of the most pervasive paradigms in neuroscience (Sporns, Tononi, and Kotter 2005;Bargmann and Marder 2013). ...

ERNet: Unsupervised Collective Extraction and Registration in Neuroimaging Data
  • Citing Conference Paper
  • August 2022