H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 68 Citations 19,996 159 World Ranking 979 National Ranking 86

Research.com Recognitions

Awards & Achievements

2020 - ACM Fellow For contributions to algorithms for large scale data processing

2016 - ACM Distinguished Member

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Database
  • Artificial intelligence

His primary areas of study are Data mining, Nearest neighbor search, Skyline, Search engine indexing and k-nearest neighbors algorithm. In most of his Data mining studies, his work intersects topics such as Algorithm. In general Nearest neighbor search study, his work on Best bin first often relates to the realm of Joins, thereby connecting several areas of interest.

As part of one scientific family, Yufei Tao deals mainly with the area of Skyline, narrowing it down to issues related to the Theoretical computer science, and often Distance based, Scalability and Uncertain data. Yufei Tao works mostly in the field of Search engine indexing, limiting it down to concerns involving Object and, occasionally, Index, Data management and Probabilistic logic. Yufei Tao focuses mostly in the field of k-nearest neighbors algorithm, narrowing it down to matters related to Query optimization and, in some cases, Web query classification, Tree, Aggregate and Closest facility.

His most cited work include:

  • Progressive skyline computation in database systems (756 citations)
  • An optimal and progressive algorithm for skyline queries (727 citations)
  • Anatomy: simple and effective privacy preservation (581 citations)

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

The scientist’s investigation covers issues in Data mining, Algorithm, Combinatorics, Theoretical computer science and k-nearest neighbors algorithm. His research in Data mining intersects with topics in Spatial query and Search engine indexing. His Algorithm research includes themes of Aggregate and Curse of dimensionality.

His Combinatorics research focuses on Discrete mathematics and how it relates to Range. His Theoretical computer science research is multidisciplinary, incorporating perspectives in Approximation algorithm and Graph. His study in k-nearest neighbors algorithm is interdisciplinary in nature, drawing from both Nearest neighbor search and Nearest-neighbor chain algorithm.

He most often published in these fields:

  • Data mining (34.63%)
  • Algorithm (22.44%)
  • Combinatorics (18.54%)

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

  • Algorithm (22.44%)
  • Combinatorics (18.54%)
  • Discrete mathematics (9.76%)

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

Algorithm, Combinatorics, Discrete mathematics, Parallel algorithm and Space are his primary areas of study. His work on Time complexity and Matching as part of his general Algorithm study is frequently connected to Joins, Massively parallel and Quality, thereby bridging the divide between different branches of science. His Combinatorics study incorporates themes from Amortized analysis and k-nearest neighbors algorithm.

His Discrete mathematics research incorporates themes from Classifier and Cluster analysis. His study on Parallel algorithm also encompasses disciplines like

  • Synthetic data and related Scalability, Dynamic data and Access method,
  • Enumeration, Core and Enhanced Data Rates for GSM Evolution most often made with reference to Binary relation. His studies in OPTICS algorithm integrate themes in fields like Data mining and Curse of dimensionality.

Between 2016 and 2021, his most popular works were:

  • On the Hardness and Approximation of Euclidean DBSCAN (33 citations)
  • Overlap Set Similarity Joins with Theoretical Guarantees (26 citations)
  • Output-optimal Parallel Algorithms for Similarity Joins (20 citations)

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

  • Algorithm
  • Database
  • Artificial intelligence

Yufei Tao mainly focuses on Algorithm, Joins, Discrete mathematics, Theoretical computer science and Classifier. His Algorithm research focuses on Time complexity and Parallel algorithm. His Time complexity research integrates issues from Dimension, Curse of dimensionality and Euclidean distance.

In the field of Theoretical computer science, his study on PageRank overlaps with subjects such as Node. His Classifier research incorporates themes from Binary number and Oracle. The study of Cluster analysis is intertwined with the study of Data mining in a number of ways.

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

Progressive skyline computation in database systems

Dimitris Papadias;Yufei Tao;Greg Fu;Bernhard Seeger.
international conference on management of data (2005)

1047 Citations

An optimal and progressive algorithm for skyline queries

Dimitris Papadias;Yufei Tao;Greg Fu;Bernhard Seeger.
international conference on management of data (2003)

1023 Citations

Anatomy: simple and effective privacy preservation

Xiaokui Xiao;Yufei Tao.
very large data bases (2006)

897 Citations

Query processing in spatial network databases

Dimitris Papadias;Jun Zhang;Nikos Mamoulis;Yufei Tao.
very large data bases (2003)

887 Citations

The TPR*-tree: an optimized spatio-temporal access method for predictive queries

Yufei Tao;Dimitris Papadias;Jimeng Sun.
very large data bases (2003)

757 Citations

Personalized privacy preservation

Xiaokui Xiao;Yufei Tao.
international conference on management of data (2006)

727 Citations

Continuous nearest neighbor search

Yufei Tao;Dimitris Papadias;Qiongmao Shen.
very large data bases (2002)

638 Citations

M-invariance: towards privacy preserving re-publication of dynamic datasets

Xiaokui Xiao;Yufei Tao.
international conference on management of data (2007)

600 Citations

MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries

Yufei Tao;Dimitris Papadias.
very large data bases (2001)

523 Citations

Efficient OLAP Operations in Spatial Data Warehouses

Dimitris Papadias;Panos Kalnis;Jun Zhang;Yufei Tao.
symposium on large spatial databases (2001)

448 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 Yufei Tao

Xuemin Lin

Xuemin Lin

UNSW Sydney

Publications: 105

Lei Chen

Lei Chen

Hong Kong University of Science and Technology

Publications: 92

Nikos Mamoulis

Nikos Mamoulis

University of Ioannina

Publications: 82

Christian S. Jensen

Christian S. Jensen

Aalborg University

Publications: 80

Wenjie Zhang

Wenjie Zhang

UNSW Sydney

Publications: 64

Xiaofang Zhou

Xiaofang Zhou

Hong Kong University of Science and Technology

Publications: 62

Man Lung Yiu

Man Lung Yiu

Hong Kong Polytechnic University

Publications: 62

Ying Zhang

Ying Zhang

University of Technology Sydney

Publications: 62

Baihua Zheng

Baihua Zheng

Singapore Management University

Publications: 60

Wang-Chien Lee

Wang-Chien Lee

Pennsylvania State University

Publications: 58

Mohamed F. Mokbel

Mohamed F. Mokbel

University of Minnesota

Publications: 56

Jeffrey Xu Yu

Jeffrey Xu Yu

Chinese University of Hong Kong

Publications: 55

Rui Zhang

Rui Zhang

National University of Singapore

Publications: 53

Raymond Chi-Wing Wong

Raymond Chi-Wing Wong

Hong Kong University of Science and Technology

Publications: 52

David Taniar

David Taniar

Monash University

Publications: 52

Something went wrong. Please try again later.