H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 30 Citations 4,509 152 World Ranking 8742 National Ranking 249

Overview

What is he best known for?

The fields of study he is best known for:

  • Artificial intelligence
  • Algorithm
  • Machine learning

Ying Zhang mostly deals with Data mining, Theoretical computer science, Object, Search engine indexing and Graph. His work carried out in the field of Data mining brings together such families of science as Data modeling, Spatial query, Set and k-nearest neighbors algorithm. His Theoretical computer science study which covers Computation that intersects with Combinatorics, Core and Similarity.

His Search engine indexing research includes themes of Nearest neighbor search and Database. His study on Subgraph isomorphism problem is often connected to Modular decomposition, Quality and Point as part of broader study in Graph. His Skyline study integrates concerns from other disciplines, such as Time complexity and Dynamic programming, Mathematical optimization, Approximation algorithm.

His most cited work include:

  • Selecting Stars: The k Most Representative Skyline Operator (342 citations)
  • Taming verification hardness: an efficient algorithm for testing subgraph isomorphism (246 citations)
  • Probabilistic Skyline Operator over Sliding Windows (111 citations)

What are the main themes of his work throughout his whole career to date?

His main research concerns Theoretical computer science, Data mining, Graph, Set and Vertex. He works mostly in the field of Theoretical computer science, limiting it down to concerns involving Pruning and, occasionally, Location-based service. Ying Zhang combines subjects such as Object, Spatial query, Search engine indexing and k-nearest neighbors algorithm with his study of Data mining.

His Graph research is multidisciplinary, incorporating elements of Graph and Computation. The various areas that Ying Zhang examines in his Set study include Ranking, Synthetic data, Containment and Skyline. His work focuses on many connections between Vertex and other disciplines, such as Time complexity, that overlap with his field of interest in Mathematical optimization.

He most often published in these fields:

  • Theoretical computer science (28.72%)
  • Data mining (28.21%)
  • Graph (21.54%)

What were the highlights of his more recent work (between 2019-2021)?

  • Theoretical computer science (28.72%)
  • Vertex (16.41%)
  • Graph (21.54%)

In recent papers he was focusing on the following fields of study:

Ying Zhang mainly investigates Theoretical computer science, Vertex, Graph, Bipartite graph and Algorithm. Ying Zhang interconnects Scalability, Graph, Power graph analysis and Pruning in the investigation of issues within Theoretical computer science. He combines subjects such as Time complexity, Computation, Core and Social network with his study of Vertex.

His Graph research includes elements of Artificial neural network, Reachability, Search engine indexing and Index. The concepts of his Algorithm study are interwoven with issues in Precision and recall, Nearest neighbor search, Curse of dimensionality and k-nearest neighbors algorithm. His study looks at the relationship between Nearest neighbor search and topics such as Metric space, which overlap with Data mining.

Between 2019 and 2021, his most popular works were:

  • Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement (63 citations)
  • A survey of community search over big graphs (48 citations)
  • Efficient Bitruss Decomposition for Large-scale Bipartite Graphs (10 citations)

In his most recent research, the most cited papers focused on:

  • Artificial intelligence
  • Algorithm
  • Machine learning

Graph, Vertex, Combinatorics, Computation and Speedup are his primary areas of study. His Graph study incorporates themes from Set and Information retrieval, Search engine indexing. His studies in Set integrate themes in fields like Property and Signed graph.

His study on Vertex also encompasses disciplines like

  • Graph which connect with Correctness, Complete bipartite graph, Graph theory, Clique and Theoretical computer science,
  • Bipartite graph, which have a strong connection to Process, Enumeration and Enhanced Data Rates for GSM Evolution. The study incorporates disciplines such as Social network and Vertex in addition to Computation. His Pruning study combines topics from a wide range of disciplines, such as Range and Data mining.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Selecting Stars: The k Most Representative Skyline Operator

Xuemin Lin;Yidong Yuan;Qing Zhang;Ying Zhang.
international conference on data engineering (2007)

454 Citations

Taming verification hardness: an efficient algorithm for testing subgraph isomorphism

Haichuan Shang;Ying Zhang;Xuemin Lin;Jeffrey Xu Yu.
very large data bases (2008)

357 Citations

Probabilistic skyline operator over sliding windows

Wenjie Zhang;Xuemin Lin;Ying Zhang;Wei Wang.
Information Systems (2013)

160 Citations

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search

Chengyuan Zhang;Ying Zhang;Wenjie Zhang;Xuemin Lin.
IEEE Transactions on Knowledge and Data Engineering (2016)

157 Citations

Probabilistic Skyline Operator over Sliding Windows

Wenjie Zhang;Xuemin Lin;Ying Zhang;Wei Wang.
international conference on data engineering (2009)

142 Citations

Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement

Wen Li;Ying Zhang;Yifang Sun;Wei Wang.
IEEE Transactions on Knowledge and Data Engineering (2020)

122 Citations

Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks

Muhammad Aamir Cheema;Wenjie Zhang;Xuemin Lin;Ying Zhang.
very large data bases (2012)

120 Citations

Influence zone: Efficiently processing reverse k nearest neighbors queries

Muhammad Aamir Cheema;Xuemin Lin;Wenjie Zhang;Ying Zhang.
international conference on data engineering (2011)

116 Citations

SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index

Yifang Sun;Wei Wang;Jianbin Qin;Ying Zhang.
very large data bases (2014)

100 Citations

AP-Tree: Efficiently support continuous spatial-keyword queries over stream

Xiang Wang;Ying Zhang;Wenjie Zhang;Xuemin Lin.
international conference on data engineering (2015)

88 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Ying Zhang

Xuemin Lin

Xuemin Lin

UNSW Sydney

Publications: 79

Wenjie Zhang

Wenjie Zhang

UNSW Sydney

Publications: 45

Jeffrey Xu Yu

Jeffrey Xu Yu

Chinese University of Hong Kong

Publications: 34

Xiaofang Zhou

Xiaofang Zhou

Hong Kong University of Science and Technology

Publications: 32

Lei Chen

Lei Chen

Hong Kong University of Science and Technology

Publications: 31

Lu Qin

Lu Qin

University of Technology Sydney

Publications: 31

Jianliang Xu

Jianliang Xu

Hong Kong Baptist University

Publications: 26

Gao Cong

Gao Cong

Nanyang Technological University

Publications: 25

David Taniar

David Taniar

Monash University

Publications: 24

Takahiro Hara

Takahiro Hara

Osaka University

Publications: 22

Jianzhong Li

Jianzhong Li

Harbin Institute of Technology

Publications: 19

Ge Yu

Ge Yu

Northeastern University

Publications: 18

Rui Zhang

Rui Zhang

National University of Singapore

Publications: 16

Kenli Li

Kenli Li

Hunan University

Publications: 16

Christian S. Jensen

Christian S. Jensen

Aalborg University

Publications: 16

Something went wrong. Please try again later.