Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ji Jin

dblp:10/1764 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0005-6773-074XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Query processing and optimization · 63% Spatial and temporal data management · 31% Indexing and storage engines · 6%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › selectivity estimation
range query selectivity estimation
0.122003
Toward an Accurate Analysis of Range Queries on Spatial Data · IEEE Trans. Knowl. Data Eng. 2003
Analyzing Range Queries on Spatial Data · ICDE 2000
Query processing and optimization
selectivity estimation
0.122003
Toward an Accurate Analysis of Range Queries on Spatial Data · IEEE Trans. Knowl. Data Eng. 2003
Analyzing Range Queries on Spatial Data · ICDE 2000
Spatial and temporal data management
spatial query processing
0.122003
Toward an Accurate Analysis of Range Queries on Spatial Data · IEEE Trans. Knowl. Data Eng. 2003
Analyzing Range Queries on Spatial Data · ICDE 2000
Indexing and storage engines
spatial index
0.012003
Toward an Accurate Analysis of Range Queries on Spatial Data · IEEE Trans. Knowl. Data Eng. 2003

Methods — techniques the papers use, named apart from their topics

density file · 0.1cumulative density · 0.1
YearPublicationVenuePosition
2026 Causal-inspired learning-based method for unbiased pest recognition
Ji Jin, Shifeng Dong, Chuanwen Lin
Expert Syst. Appl.2
2025 A High-Density Hybrid Buck Converter with a Charge Converging Phase Reducing Inductor Current for 12V Power Supply Systems
abstract
A 12V-input and 1-1.8V-output hybrid buck converter with a charge converging phase is presented in this summary. The charge converging phase reduces the inductor current to always less than half of load current, which reduces DCR conduction loss and mitigates the reliance on a bulky inductor. Fabricated in a 0.18μm BCD process with a die area of 5mm2, this design utilizes only 5V and 1.8V NMOS as power switches and achieves a peak efficiency of 94.7% and a current density of 685A/cm3.
Yichao Ji, Ji Jin, Lin Cheng 0001
ASP-DAC2
2023 SGNN: A New Method for Learning Representations on Signed Networks
Ji Jin, Jialin Bi, Cunquan Qu
ICANN (5)1
2015 DiSNPindel: improved intra-individual SNP and InDel detection in direct amplicon sequencing of a diploid
abstract
BACKGROUND: Amplicon re-sequencing based on the automated Sanger method remains popular for detection of single nucleotide polymorphisms (SNPs) and insertion-deletion polymorphisms (InDels) for a spectrum of genetics applications. However, existing software tools for detecting intra-individual SNPs and InDels in direct amplicon sequencing of diploid samples are insufficient in analyzing single traces and their accuracy is still limited. RESULTS: We developed a novel computation tool, named DiSNPindel, to improve the detection of intra-individual SNPs and InDels in direct amplicon sequencing of a diploid. Neither reference sequence nor additional sample was required. Using two real datasets, we demonstrated the usefulness of DiSNPindel in its ability to improve largely the true SNP and InDel discovery rates and reduce largely the missed and false positive rates as compared with existing detection methods. CONCLUSIONS: The software DiSNPindel presented here provides an efficient tool for intra-individual SNP and InDel detection in diploid amplicon sequencing. It will also be useful for identification of DNA variations in expressed sequence tag (EST) re-sequencing.
Jizhong Deng, Huasheng Huang, Xiaoli Yu, Ji Jin, Weisen Lin, Fagen Li, Zhijiao Song, Siming Gan
BMC Bioinform.4
2003 Toward an Accurate Analysis of Range Queries on Spatial Data
abstract
Analysis of range queries on spatial (multidimensional) data is both important and challenging. Most previous analysis attempts have made certain simplifying assumptions about the data sets and/or queries to keep the analysis tractable. As a result, they may not be universally applicable. This paper proposes a set of five analysis techniques to estimate the selectivity and number of index nodes accessed in serving a range query. The underlying philosophy behind these techniques is to maintain an auxiliary data structure, called a density file, whose creation is a one-time cost, which can be quickly consulted when the query is given. The schemes differ in what information is kept in the density file, how it is maintained, and how this information is looked up. It is shown that one of the proposed schemes, called cumulative density (CD), gives very accurate results (usually less than 5 percent error) using a diverse suite of point and rectangular data sets, that are uniform or skewed, and a wide range of query window parameters. The estimation takes a constant amount of time, which is typically lower than 1 percent of the time that it would take to execute the query, regardless of data set or query window parameters.
Ning An 0001, Ji Jin, Anand Sivasubramaniam
IEEE Trans. Knowl. Data Eng.2
2000 Analyzing Range Queries on Spatial Data
abstract
Analysis of range queries on spatial (multidimensional) data is both important and challenging. Most previous analysis attempts have made certain simplifying assumptions about the data sets and/or queries to keep the analysis tractable. As a result, they may no be universally applicable. This paper proposes a set of five analysis techniques to estimate the selectivity and number of index nodes accessed in serving a range query. The underlying philosophy behind these techniques is to maintain an auxiliary data structure called a density file, whose creation is a one-time cost, which can be quickly consulted when the query is given. The schemes differ in what information is kept in the density file, how it is maintained and how this information is looked up. It is shown that one of the proposed schemes, called "cumulative density" (CD), gives very accurate results (usually less then 5% error) using a diverse suite of point and rectangular data sets, that are uniform or skewed, and a wide range of query window parameters. The estimation takes a constant amount of time, which is typically lower than 1% of the time that it would take to execute the query, regardless of data set or query window parameters.
Ji Jin, Ning An 0001, Anand Sivasubramaniam
ICDE1