Cheng Yang
Proceedings / International Conference on Data Engineering · with Cohen · 2000
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Cheng Yang trusts
Their strongest outbound trust, strongest first, inferred from their citations.
- Andrei Z. Broder (in Information Retrieval & Search)
- Rakesh Agrawal (in Algorithms & Complexity)
Who trusts Cheng Yang
- Moses Charikar (in Computational Theory and Mathematics)
Papers from Cheng Yang's perspective
Ordered by how strongly the researchers Cheng Yang trusts endorse each paper. Same corpus, a different order for every researcher.
- Fast Algorithms for Mining Association Rules
- Pattern classification and scene analysis
- Using collaborative filtering to weave an information tapestry
- Mining association rules between sets of items in large databases
- On the resemblance and containment of documents
- Size-Estimation Framework with Applications to Transitive Closure and Reachability
- Similarity Search in High Dimensions via Hashing
- Randomized algorithms
- Algorithms for Clustering Data
- Human behavior and the principle of least effort
Their papers
- Finding interesting associations without support pruning (2000) — 494 citations