Lianyin Jia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lianyin Jia has a total of 102 co-authors. Here are the top co-authors by number of shared publications:
- Jiaman Ding
Kunming University of Science and Technology, Kunming, China
10 shared publications - Runxin Li
Affiliations Yunnan Key Laboratory of Computer Technologies Application, Kunming University of Science and Technology, Kunming, China, Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, China
9 shared publications - Jinguo You
Kunming University of Science and Technology
7 shared publications - Xiaodong Fu
Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, China
6 shared publications - Yinong Chen
School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ, USA
6 shared publications - Jiaman Ding
Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, China
5 shared publications
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3843-3847
An Asymmetric-difference based Document Exact Similarity Search Algorithm
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3843-3847
Open AccessAn Asymmetric-difference based Document Exact Similarity Search Algorithm
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3838-3842
Efficient Query Region Expansion and Decomposition based Spatial Range Query Algorithm
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3838-3842
Open AccessEfficient Query Region Expansion and Decomposition based Spatial Range Query Algorithm
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP  (10414347) , 1-13
HQT-TI: an Efficient Hilbert Curve Based Index for Spatial Keyword Queries
This paper introduces HQT-TI, a novel indexing method designed to improve the efficiency of spatial keyword queries. HQT-TI consists of two main components: a Hilbert QuadTree (HQT) based spatial index and a Trie-Inverted index (TI) combined textual index. HQT integrates the Hilbert curve with a Quadtree, establishing a direct relationship between the two. TI combines a trie and inverted index to minimize the intersection cost associated with long lists, thus improving the speed of keyword queries. The HQT based Spatial Query algorithm (HQT-SQ) reduces overlap checks and limits irrelevant object retrieval by employing query drill-down and depth first search with limited breadth expansion in spatial queries. Meanwhile, the Segment List Intersection based Keyword Query algorithm (SLI-KQ), built on TI, efficiently handles segment list intersections for keyword queries. The combination of HQT-SQ and SLI-KQ results in HS-SK, a highly efficient spatial keyword query algorithm. Extensive experimental results demonstrate that HS-SKQ outperforms SFC-Quad by up to two orders of magnitude, achieving up to a 5.46× speedup over the best existing competitors, making it a promising solution for large-scale spatial keyword query processing.
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP  (10414347) , 1-13
HQT-TI: an Efficient Hilbert Curve Based Index for Spatial Keyword Queries
This paper introduces HQT-TI, a novel indexing method designed to improve the efficiency of spatial keyword queries. HQT-TI consists of two main components: a Hilbert QuadTree (HQT) based spatial index and a Trie-Inverted index (TI) combined textual index. HQT integrates the Hilbert curve with a Quadtree, establishing a direct relationship between the two. TI combines a trie and inverted index to minimize the intersection cost associated with long lists, thus improving the speed of keyword queries. The HQT based Spatial Query algorithm (HQT-SQ) reduces overlap checks and limits irrelevant object retrieval by employing query drill-down and depth first search with limited breadth expansion in spatial queries. Meanwhile, the Segment List Intersection based Keyword Query algorithm (SLI-KQ), built on TI, efficiently handles segment list intersections for keyword queries. The combination of HQT-SQ and SLI-KQ results in HS-SK, a highly efficient spatial keyword query algorithm. Extensive experimental results demonstrate that HS-SKQ outperforms SFC-Quad by up to two orders of magnitude, achieving up to a 5.46× speedup over the best existing competitors, making it a promising solution for large-scale spatial keyword query processing.
- 1 May 2026
- Published by Elsevier in Information Fusion
- Vol. 135
FedKSS: One-shot federated learning with kernel space statistics
- 1 May 2026
- Published by Elsevier in Information Fusion
- Vol. 135
FedKSS: One-shot federated learning with kernel space statistics
- Open Access
- 1 September 2025
- Published by Tsinghua University Press in Tsinghua Science and Technology
Efficient Lookup Table Based Z-Order Curve Encoding and Decoding: Algorithms, Parallelization, and Applications
Z-order curve, as an efficient method for reducing spatial dimensionality, has found widespread applications in various fields. Although existing state-of-the-art algorithms design dimensional lookup tables, they suffer from the drawback of high table lookup frequency. To address this issue, we propose a novel and efficient g-order Value LookUp Table (namely VLUTg), which can directly obtain the corresponding code (or coordinate) through coordinate (or code). Building upon this, we present efficient Z-order curve encoding and decoding algorithms based on VLUTg , and further design the coarse-grained and fine-grained parallel Z-order curve encoding and decoding algorithms based on Graphics Processing Units (GPU), thus significantly enhancing the efficiency of Z-order curve encoding and decoding. We further propose VLUTg combining with B+-tree (VLUTg-B+) algorithm to extend our algorithms to support spatial range query. Experimental results on multiple datasets demonstrate that our encoding and decoding algorithms perform well when g is set to 8, with encoding 25 million 32-order discrete coordinate data requiring only 6.556 ms, achieving an efficiency improvement of two orders of magnitude compared to the fastest known algorithm. Besides, VLUTg-B+ can be up to 5.67× faster than R*-tree on spatial range query.
- 1 September 2025
- Published by Tsinghua University Press in Tsinghua Science and Technology
Open AccessEfficient Lookup Table Based Z-Order Curve Encoding and Decoding: Algorithms, Parallelization, and Applications
Z-order curve, as an efficient method for reducing spatial dimensionality, has found widespread applications in various fields. Although existing state-of-the-art algorithms design dimensional lookup tables, they suffer from the drawback of high table lookup frequency. To address this issue, we propose a novel and efficient g-order Value LookUp Table (namely VLUTg), which can directly obtain the corresponding code (or coordinate) through coordinate (or code). Building upon this, we present efficient Z-order curve encoding and decoding algorithms based on VLUTg , and further design the coarse-grained and fine-grained parallel Z-order curve encoding and decoding algorithms based on Graphics Processing Units (GPU), thus significantly enhancing the efficiency of Z-order curve encoding and decoding. We further propose VLUTg combining with B+-tree (VLUTg-B+) algorithm to extend our algorithms to support spatial range query. Experimental results on multiple datasets demonstrate that our encoding and decoding algorithms perform well when g is set to 8, with encoding 25 million 32-order discrete coordinate data requiring only 6.556 ms, achieving an efficiency improvement of two orders of magnitude compared to the fastest known algorithm. Besides, VLUTg-B+ can be up to 5.67× faster than R*-tree on spatial range query.
- 29 April 2025
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 16  (9) , 6957-6976
Tree comprehensive diversity-based pruned deep forest
- 29 April 2025
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 16  (9) , 6957-6976
Tree comprehensive diversity-based pruned deep forest
- Open Access
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 202-209
Protein Function Prediction Based on Group Correlation
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 202-209
Open AccessProtein Function Prediction Based on Group Correlation
- Open Access
- 31 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 62353-62366
Clustering Algorithm by Boundary Detection Base on Entropy of KNN
Clustering analysis has been widely applied in various fields, and boundary detection based clustering algorithms have shown effective performance. In this work, we propose a clustering algorithm by boundary detection based on entropy of KNN (CBDEK). A border point contains only the nearest neighbors within a specific directional range. Thus, we define entropy of KNN (EK) to accurately identify the boundary of the cluster. Since entropy has the property of measuring uncertainty, it can be used to quantify the possibility that a point is a border point. A lower EK indicates an uneven neighbor distribution, increasing the possibility of the point being a border point. Then, the border points are clustered based on the directional similarity of their nearest neighbors. Specifically, if a border point is a neighbor of another border point and most of their nearest neighbors show directional similarity, they are considered to belong to the same cluster. Furthermore, we assign the label of a border point to the interior points located within the maximum nearest neighbor sub-block of this border point to facilitate an efficient allocation for the remaining points (interior points). In addition, our algorithm incorporates noise mitigation techniques using average distance and box plot analysis. The effectiveness of CBDEK is proven by a comparative evaluation of nine algorithms on 24 datasets.
- 31 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 62353-62366
Open AccessClustering Algorithm by Boundary Detection Base on Entropy of KNN
Clustering analysis has been widely applied in various fields, and boundary detection based clustering algorithms have shown effective performance. In this work, we propose a clustering algorithm by boundary detection based on entropy of KNN (CBDEK). A border point contains only the nearest neighbors within a specific directional range. Thus, we define entropy of KNN (EK) to accurately identify the boundary of the cluster. Since entropy has the property of measuring uncertainty, it can be used to quantify the possibility that a point is a border point. A lower EK indicates an uneven neighbor distribution, increasing the possibility of the point being a border point. Then, the border points are clustered based on the directional similarity of their nearest neighbors. Specifically, if a border point is a neighbor of another border point and most of their nearest neighbors show directional similarity, they are considered to belong to the same cluster. Furthermore, we assign the label of a border point to the interior points located within the maximum nearest neighbor sub-block of this border point to facilitate an efficient allocation for the remaining points (interior points). In addition, our algorithm incorporates noise mitigation techniques using average distance and box plot analysis. The effectiveness of CBDEK is proven by a comparative evaluation of nine algorithms on 24 datasets.
- 17 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 273
Semi-supervised multi-label feature selection combining nonlinear manifold structure and minimizing group sparse redundant correlation
- 17 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 273
Semi-supervised multi-label feature selection combining nonlinear manifold structure and minimizing group sparse redundant correlation