Runying Mao

Information Systems · 2000–2004

A researcher in the Science corpus: 2 papers; trusts 7 researchers and is trusted by 5 researchers here, as inferred from the citation graph.

Subfields

• Information Systems — 8 citations into it; #4,386 of 8,771 by trust here, #4,341 by citations
• Computational Theory and Mathematics — 7 citations into it; #6,953 of 12,182 by trust here, #5,046 by citations
• Signal Processing — 5 citations into it

Whom Runying Mao trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Rakesh Agrawal
2. Jiawei Han
3. Jian Pei
4. Rayadurgam Srikant

Who trusts Runying Mao overall

1. Mohammed J. Zaki
2. Jiawei Han
3. Gösta Grahne
4. Jianyong Wang
5. Jianfei Zhu
6. Ching-Jui Hsiao
7. Nafise Sadat Moosavi
8. Philippe Fournier-Viger

Papers from Runying Mao's perspective

Ordered by how strongly the researchers Runying Mao trusts endorse each paper. Same corpus, a different order for every researcher.

1. A Tree Projection Algorithm for Generation of Frequent Item Sets (J. Parallel Distributed Comput.)
2. Mining frequent patterns without candidate generation
3. Fast Algorithms for Mining Association Rules in Large Databases
4. Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
5. ImageNet classification with deep convolutional neural networks
6. Attention is All you Need (Neural Information Processing Systems)
7. Learning Multiple Layers of Features from Tiny Images
8. Adam: A Method for Stochastic Optimization (International Conference on Learning Representations)
9. Gradient-based learning applied to document recognition
10. Distilling the Knowledge in a Neural Network (arXiv.org)

Their papers

• Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach (2004) — 2,805 citations
• CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets (2000) — 984 citations