World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
41
Citations
8076
World Ranking
8758
National Ranking
3745

Research.com Recognitions

  • 2014 - ACM Senior Member

Overview

What is he best known for?

The fields of study he is best known for:

  • Operating system
  • Database
  • Artificial intelligence

Yun Chi spends much of his time researching Data mining, Artificial intelligence, Machine learning, Social network and Tree. Particularly relevant to Data stream mining is his body of work in Data mining. His work in the fields of Artificial intelligence, such as Bayesian inference, Stochastic block model, Posterior probability and Word, intersects with other areas such as Projection.

When carried out as part of a general Machine learning research project, his work on Bayesian network is frequently linked to work in Point estimation, therefore connecting diverse disciplines of study. His research integrates issues of Time complexity and Blogosphere in his study of Social network. His Tree study integrates concerns from other disciplines, such as Transaction processing and Data structure.

His most cited work include:

  • Facetnet: a framework for analyzing communities and their evolutions in dynamic networks (338 citations)
  • Evolutionary spectral clustering by incorporating temporal smoothness (321 citations)
  • Combining link and content for community detection: a discriminative approach (305 citations)

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

Yun Chi mainly focuses on Data mining, Information retrieval, Artificial intelligence, Cloud computing and Database. The various areas that Yun Chi examines in his Data mining study include Tree, Data stream clustering and Correlation clustering, Canopy clustering algorithm. The concepts of his Information retrieval study are interwoven with issues in Web page, Web mining and Document clustering.

His Artificial intelligence research is multidisciplinary, relying on both Machine learning and Pattern recognition. His Machine learning research is multidisciplinary, incorporating elements of Time complexity, Social network and Bayesian inference. His study in Cloud computing is interdisciplinary in nature, drawing from both Workload and Computer network.

He most often published in these fields:

  • Data mining (39.13%)
  • Information retrieval (17.39%)
  • Artificial intelligence (17.39%)

What were the highlights of his more recent work (between 2012-2018)?

  • Cloud computing (15.94%)
  • Database (15.94%)
  • Distributed computing (11.59%)

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

Yun Chi mainly investigates Cloud computing, Database, Distributed computing, Multitenancy and Query optimization. His Cloud computing study incorporates themes from Workload and Replication. His Distributed computing research includes elements of Provisioning, Operating system and I/O bound.

Query optimization is the subject of his research, which falls under Data mining. Yun Chi regularly links together related areas like Dynamic database in his Data mining studies. His Service-level agreement research integrates issues from Virtualization, Resource allocation and Service.

Between 2012 and 2018, his most popular works were:

  • Predicting query execution time: Are optimizer cost models really unusable? (105 citations)
  • Towards predicting query execution time for concurrent and dynamic database workloads (58 citations)
  • PMAX: tenant placement in multitenant databases for profit maximization (42 citations)

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

  • Operating system
  • Database
  • Artificial intelligence

Yun Chi mostly deals with Query optimization, Query expansion, Data mining, Query plan and Online aggregation. His Query optimization study combines topics from a wide range of disciplines, such as Workload, Scheduling, Dynamic database and Distributed computing. Yun Chi applies his multidisciplinary studies on Query plan and View in his research.

Best Publications

  • Facetnet: a framework for analyzing communities and their evolutions in dynamic networks

    Yu-Ru Lin;Yun Chi;Shenghuo Zhu;Hari Sundaram

  • Evolutionary spectral clustering by incorporating temporal smoothness

    Yun Chi;Xiaodan Song;Dengyong Zhou;Koji Hino

  • Moment: maintaining closed frequent itemsets over a stream sliding window

    Yun Chi;Haixun Wang;P.S. Yu;R.R. Muntz

  • Combining link and content for community detection: a discriminative approach

    Tianbao Yang;Rong Jin;Yun Chi;Shenghuo Zhu

  • Detecting communities and their evolutions in dynamic social networks--a Bayesian approach

    Tianbao Yang;Yun Chi;Shenghuo Zhu;Yihong Gong

  • Analyzing communities and their evolutions in dynamic social networks

    Yu-Ru Lin;Yun Chi;Shenghuo Zhu;Hari Sundaram

  • Identifying opinion leaders in the blogosphere

    Xiaodan Song;Yun Chi;Koji Hino;Belle Tseng

  • Frequent Subtree Mining - An Overview

    Yun Chi;Richard R. Muntz;Siegfried Nijssen;Joost N. Kok

  • Combining content and link for classification using matrix factorization

    Shenghuo Zhu;Kai Yu;Yun Chi;Yihong Gong

  • Predicting query execution time: Are optimizer cost models really unusable?

    Wentao Wu;Yun Chi;Shenghuo Zhu;J. Tatemura

  • On evolutionary spectral clustering

    Yun Chi;Xiaodan Song;Dengyong Zhou;Koji Hino

  • Intelligent management of virtualized resources for database systems in cloud environment

    Pengcheng Xiong;Yun Chi;Shenghuo Zhu;Hyun Jin Moon

  • Information flow modeling based on diffusion rate for prediction and ranking

    Xiaodan Song;Yun Chi;Koji Hino;Belle L. Tseng

  • Catch the moment: maintaining closed frequent itemsets over a data stream sliding window

    Yun Chi;Haixun Wang;Philip S. Yu;Richard R. Muntz

  • Mining closed and maximal frequent subtrees from databases of labeled rooted trees

    Yun Chi;Yi Xia;Yirong Yang;R.R. Muntz

  • Incremental spectral clustering by efficiently updating the eigen-system

    Huazhong Ning;Wei Xu;Yun Chi;Yihong Gong

  • CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees

    Yun Chi;Yirong Yang;Yi Xia;Richard R. Muntz

  • HybridTreeMiner: an efficient algorithm for mining frequent rooted trees and free trees using canonical forms

    Yun Chi;Yirong Yang;R.R. Muntz

  • Indexing and mining free trees

    Y. Chi;Y. Yang;R.R. Muntz

  • Incremental spectral clustering with application to monitoring of evolving blog communities

    Huazhong Ning;Wei Xu;Yun Chi;Yihong Gong

  • Blog Community Discovery and Evolution Based on Mutual Awareness Expansion

    Yu-Ru Lin;Hari Sundaram;Yun Chi;Junichi Tatemura

  • Correction to "Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees"

    Yun Chi;Yi Xia;Yirong Yang;R.R. Muntz

Frequent Co-Authors

Belle L. Tseng
Belle L. Tseng Apple (United States)
Yihong Gong
Yihong Gong Xi'an Jiaotong University
Richard R. Muntz
Richard R. Muntz University of California, Los Angeles
Hari Sundaram
Hari Sundaram University of Illinois at Urbana-Champaign
Yu-Ru Lin
Yu-Ru Lin University of Pittsburgh
Philip S. Yu
Philip S. Yu University of Illinois at Chicago
Rong Jin
Rong Jin Alibaba Group (China)
Tianbao Yang
Tianbao Yang Texas A&M University
Zhongfei Zhang
Zhongfei Zhang Binghamton University

External Links

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

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring online degrees and certifications can open up new career pathways for students and professionals interested in computer science. For those seeking affordable graduate education, the cheapest master in data science options in the USA allow you to gain in-demand skills without breaking the bank.

If you’re interested in engineering, there are accredited online electrical engineering programs available from top universities, providing the flexibility to study at your own pace while maintaining academic standards.

Not everyone needs a traditional degree to advance their career. Many tech roles value certifications, and there are easy licenses and certifications to get that can boost your qualifications and lead to well-paying jobs in tech fields.

For those with limited time, consider the shortest master degree programs that allow you to obtain a master's degree quickly and efficiently, letting you enter the workforce or change career direction faster.

Best Scientists Citing Yun Chi

Trending Scientists

Recently Published Articles