Xin Huang

Xin Huang

Auto-generated profile, based on publicly available information

Xin Huang

Hong Kong Baptist University, Hong Kong, Hong Kong

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
20 July 2019 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
Yixiang FangYixiang Fang
Yixiang Fang
XHXin Huang
Xin Huang
LQLu Qin
Lu Qin
YZYing Zhang
Ying Zhang
Wenjie ZhangWenjie Zhang
Wenjie Zhang
XLXuemin Lin
Xuemin Lin

11 September 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
Jin DiJin Di
Jin Di
KWKunzeng Wang
Kunzeng Wang
GZGe Zhang
Ge Zhang
PJPengfei Jiao
Pengfei Jiao
Dongxiao HeDongxiao He
Dongxiao He
XHXin Huang
Xin Huang
Finding semantic communities using network topology and contents together is a hot topic in community detection. Existing methods often use word attributes in an indiscriminate way to help finding communities. Through the analysis we find that, words in networked contents often embody a hierarchical semantic structure. Some words reflect a background topic of the whole network with all communities, some imply the high-level general topic covering several topic-related communities, and some imply the high-resolution specialized topic to describe each community. Ignoring such semantic structures often leads to defects in depicting networked contents where deep semantics are not fully utilized. To solve this problem, we propose a new Bayesian probabilistic model. By distinguishing words from either a background topic or some two-level topics (i.e. general and specialized topics), this model not only better utilizes the networked contents to help finding communities, but also provides a clearer multiplex semantic community interpretation. We then give an efficient variational algorithm for model inference. The superiority of this new approach is demonstrated by comparing with ten state-of-the-art methods on nine real networks and an artificial benchmark. A case study is further provided to show its strong ability in deep semantic interpretation of communities.

22 April 2021 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
YJYuli Jiang
Yuli Jiang
XHXin Huang
Xin Huang
HCHong Cheng
Hong Cheng

26 November 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LSLongxu Sun
Longxu Sun
XHXin Huang
Xin Huang
RLRonghua Li
Ronghua Li
BCByron Choi
Byron Choi
JXJianliang Xu
Jianliang Xu
Community search that finds query-dependent communities has been studied on various kinds of graphs. As one instance of community search, intimate-core group (community) search over a weighted graph is to find a connected $k$ -core containing all query nodes with the smallest group weight. However, existing state-of-the-art methods start from the maximal $k$ -core to refine an answer, which is practically inefficient for large networks. In this paper, we develop an efficient framework, called l ocal e xploration k -core s earch (LEKS), to find intimate-core groups in graphs. We propose a small-weighted spanning tree to connect query nodes, and then expand the tree level by level to a connected $k$ -core, which is finally refined as an intimate-core group. In addition, to support the intimate group search over large weighted graphs, we develop a weighted-core index (WC-index) and two new WC-index-based algorithms for expansion and refinement phases in LEKS. Specifically, we propose a WC-index-based expansion to efficiently find a candidate graph of intimate-core group, leveraging on a two-level expansion of $k$ -breadth and 1-depth. We propose two graph removal strategies: coarse-grained refinement is designed for large graphs to delete a batch of nodes in a few iterations; fine-grained refinement is designed for small graphs to remove nodes carefully and achieve high-quality answers. Extensive experiments on real-life networks with ground-truth communities validate the effectiveness and efficiency of our proposed methods.

5 March 2018 in BMC Genomics
Verified
Journal Article
Open access
PDF file
JIJack Chi-Ho Ip
Jack Chi-Ho Ip
HMHuawei Mu
Huawei Mu
QCQian Chen
Qian Chen
JSJin Sun
Jin Sun
SISantiago Ituarte
Santiago Ituarte
JQJian-Wen Qiu
Jian-Wen Qiu
Gastropoda, with approximately 80,000 living species, is the largest class of Mollusca. Among gastropods, apple snails (family Ampullariidae) are globally distributed in tropical and subtropical freshwater ecosystems and many species are ecologically and economically important. Ampullariids exhibit various morphological and physiological adaptations to their respective habitats, which make them ideal candidates for studying adaptation, population divergence, speciation, and larger-scale patterns of diversity, including the biogeography of native and invasive populations. The limited availability of genomic data, however, hinders in-depth ecological and evolutionary studies of these non-model organisms. Using Illumina Hiseq platforms, we sequenced 1220 million reads for seven species of apple snails. Together with the previously published RNA-Seq data of two apple snails, we conducted de novo transcriptome assembly of eight species that belong to five genera of Ampullariidae, two of which represent Old World lineages and the other three New World lineages. There were 20,730 to 35,828 unigenes with predicted open reading frames for the eight species, with N50 (shortest sequence length at 50% of the unigenes) ranging from 1320 to 1803 bp. 69.7% to 80.2% of these unigenes were functionally annotated by searching against NCBI’s non-redundant, Gene Ontology database and the Kyoto Encyclopaedia of Genes and Genomes. With these data we developed AmpuBase, a relational database that features online BLAST functionality for DNA/protein sequences, keyword searching for unigenes/functional terms, and download functions for sequences and whole transcriptomes. In summary, we have generated comprehensive transcriptome data for multiple ampullariid genera and species, and created a publicly accessible database with a user-friendly interface to facilitate future basic and applied studies on ampullariids, and comparative molecular studies with other invertebrates.

2 October 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Open access
WSWenbo Shang
Wenbo Shang
XHXin Huang
Xin Huang
A graph is a fundamental data model to represent various entities and their complex relationships in society and nature, such as social networks, transportation networks, financial networks, and biomedical systems. Recently, large language models (LLMs) have showcased a strong generalization ability to handle various natural language processing tasks to answer users’ arbitrary questions and generate specific-domain content. Compared with graph learning models, LLMs enjoy superior advantages in addressing the challenges of generalizing graph tasks by eliminating the need for training graph learning models and reducing the cost of manual annotation. However, LLMs are sequential models for textual data, but graphs are non-sequential topological data. It is challenging to adapt LLMs to tackle graph analytics tasks. In this survey, we conduct a comprehensive investigation of existing LLM studies on graph data, which summarizes the relevant graph analytics tasks solved by advanced LLM models and points out the existing challenges and future directions. Specifically, we study the key problems of LLM-based generative graph analytics (LLM-GGA) in terms of three categories: LLM-based graph query processing (LLM-GQP), LLM-based graph inference and learning (LLM-GIL), and graph-LLM-based applications. LLM-GQP focuses on an integration of graph analytics techniques and LLM prompts, including graph understanding and knowledge graphs and LLMs, while LLM-GIL focuses on learning and reasoning over graphs, including graph learning, graph-formed reasoning, and graph representation. We summarize the useful prompts incorporated into LLM to handle different graph downstream tasks. Moreover, we give a summary of LLM model evaluation, benchmark datasets/tasks, and a deep pro and cons analysis of the discussed LLM-GGA models. We also explore open problems and future directions in this exciting interdisciplinary research area of LLMs and graph analytics.