Xiangnan Kong

Xiangnan Kong

Auto-generated profile, based on publicly available information

Xiangnan Kong

Computer Science Department University of Illinois at Chicago USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 May 2011 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
XKXiangnan Kong
Xiangnan Kong
PYPhilip S. Yu
Philip S. Yu

28 April 2014
Verified
Conference Paper
Closed access
LHLifang He
Lifang He
XKXiangnan Kong
Xiangnan Kong
PYPhilip S. Yu
Philip S. Yu
XYXiaowei Yang
Xiaowei Yang
ARAnn B. Ragin
Ann B. Ragin
ZHZhifeng Hao
Zhifeng Hao
With advances in data collection technologies, tensor data is assuming increasing prominence in many applications and the problem of supervised tensor learning has emerged as a topic of critical significance in the data mining and machine learning community. Conventional methods for supervised tensor learning mainly focus on learning kernels by flattening the tensor into vectors or matrices, however structural information within the tensors will be lost. In this paper, we introduce a new scheme to design structure-preserving kernels for supervised tensor learning. Specifically, we demonstrate how to leverage the naturally available structure within the tensorial representation to encode prior knowledge in the kernel. We proposed a tensor kernel that can preserve tensor structures based upon dual-tensorial mapping. The dual-tensorial mapping function can map each tensor instance in the input space to another tensor in the feature space while preserving the tensorial structure. Theoretically, our approach is an extension of the conventional kernels in the vector space to tensor space. We applied our novel kernel in conjunction with SVM to real-world tensor classification problems including brain fMRI classification for three different diseases (i.e., Alzheimer's disease, ADHD and brain damage by HIV). Extensive empirical studies demonstrate that our proposed approach can effectively boost tensor classification performances, particularly with small sample sizes.

2 May 2013 in Proceedings of the ... SIAM International Conference on Data Mining. SIAM International Conference on Data Mining
Verified
Conference Paper
Closed access
XKXiangnan Kong
Xiangnan Kong
PYPhilip S. Yu
Philip S. Yu
XWXue Wang
Xue Wang
ARAnn B. Ragin
Ann B. Ragin
Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objects are certain, and the binary edges within each graph represent the “presence” of linkages among the nodes. In many real-world applications, however, the linkage structure of the graphs is inherently uncertain. Therefore, existing measurements of interestingness based upon certain graphs are unable to capture the structural uncertainty in these applications effectively. In this paper, we study the problem of discriminative subgraph feature selection from uncertain graphs. This problem is challenging and different from conventional subgraph mining problems because both the structure of the graph objects and the discrimination score of each subgraph feature are uncertain. To address these challenges, we propose a novel discriminative subgraph feature selection method, DUG, which can find discriminative subgraph features in uncertain graphs based upon different statistical measures including expectation, median, mode and φ-probability. We first compute the probability distribution of the discrimination scores for each subgraph feature based on dynamic programming. Then a branch-and-bound algorithm is proposed to search for discriminative subgraphs efficiently. Extensive experiments on various neuroimaging applications (i.e., Alzheimers Disease, ADHD and HIV) have been performed to analyze the gain in performance by taking into account structural uncertainties in identifying discriminative subgraph features for graph classification.

1 January 2011
Verified
Conference Paper
Closed access
XKXiangnan Kong
Xiangnan Kong
PYPhilip Yu
Philip Yu

24 January 2012 in Proceedings of the American Society for Information Science and Technology
Verified
Journal Article
Open access
PDF file
EYErjia Yan
Erjia Yan
YDYing Ding
Ying Ding
XKXiangnan Kong
Xiangnan Kong
The production and creation of knowledge is not dependent on any individual and isolated entity; instead, knowledge is diffused, exchanged, and circulated among various entities. To study the knowledge flow and transfer within and across different disciplines can help us better understand science and scientific collaboration. This paper presents a methodological framework to study knowledge flow, including a knowledge hierarchy, the construction of knowledge flow network, and indicators that can be used to measure disciplinarities.

13 October 2013 in arXiv
Verified
Preprint
Open access
PDF file
JZJiawei Zhang
Jiawei Zhang
XKXiangnan Kong
Xiangnan Kong
PYPhilip S. Yu
Philip S. Yu
Online social networks have gained great success in recent years and many of them involve multiple kinds of nodes and complex relationships. Among these relationships, social links among users are of great importance. Many existing link prediction methods focus on predicting social links that will appear in the future among all users based upon a snapshot of the social network. In real-world social networks, many new users are joining in the service every day. Predicting links for new users are more important. Different from conventional link prediction problems, link prediction for new users are more challenging due to the following reasons: (1) differences in information distributions between new users and the existing active users (i.e., old users); (2) lack of information from the new users in the network. We propose a link prediction method called SCAN-PS (Supervised Cross Aligned Networks link prediction with Personalized Sampling), to solve the link prediction problem for new users with information transferred from both the existing active users in the target network and other source networks through aligned accounts. We proposed a within-target-network personalized sampling method to process the existing active users' information in order to accommodate the differences in information distributions before the intra-network knowledge transfer. SCAN-PS can also exploit information in other source networks, where the user accounts are aligned with the target network. In this way, SCAN-PS could solve the cold start problem when information of these new users is total absent in the target network.