2020 - ACM Fellow For contributions to algorithms for large scale data processing
2016 - ACM Distinguished Member
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.
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.
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
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.
Progressive skyline computation in database systems
Dimitris Papadias;Yufei Tao;Greg Fu;Bernhard Seeger.
international conference on management of data (2005)
An optimal and progressive algorithm for skyline queries
Dimitris Papadias;Yufei Tao;Greg Fu;Bernhard Seeger.
international conference on management of data (2003)
Anatomy: simple and effective privacy preservation
Xiaokui Xiao;Yufei Tao.
very large data bases (2006)
Query processing in spatial network databases
Dimitris Papadias;Jun Zhang;Nikos Mamoulis;Yufei Tao.
very large data bases (2003)
Personalized privacy preservation
Xiaokui Xiao;Yufei Tao.
international conference on management of data (2006)
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
Yufei Tao;Dimitris Papadias;Jimeng Sun.
very large data bases (2003)
M-invariance: towards privacy preserving re-publication of dynamic datasets
Xiaokui Xiao;Yufei Tao.
international conference on management of data (2007)
Continuous nearest neighbor search
Yufei Tao;Dimitris Papadias;Qiongmao Shen.
very large data bases (2002)
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Yufei Tao;Dimitris Papadias.
very large data bases (2001)
Efficient OLAP Operations in Spatial Data Warehouses
Dimitris Papadias;Panos Kalnis;Jun Zhang;Yufei Tao.
symposium on large spatial databases (2001)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Hong Kong University of Science and Technology
National University of Singapore
Simon Fraser University
University of Ioannina
Hong Kong Polytechnic University
Hong Kong University of Science and Technology
Fudan University
Korea Advanced Institute of Science and Technology
University of Illinois at Urbana-Champaign
University of New South Wales
Institute Of Computing Technology
Technical University of Munich
University of Pennsylvania
Florida State University
University of Wisconsin–Madison
Hewlett-Packard (United States)
Rutgers, The State University of New Jersey
Karlsruhe Institute of Technology
Langley Research Center
KU Leuven
University of Queensland
Brown University
Indiana University
Northwestern University
University of California, San Francisco
University of Illinois at Chicago