Manuel Calimlim
Information Systems · 2001–2005
A researcher in the Science corpus: 2 papers; trusts 6 researchers and is trusted by 15 researchers here, as inferred from the citation graph.
Subfields
- Information Systems — 10 citations into it; #1,382 of 8,771 by trust here, #3,098 by citations
- Computational Theory and Mathematics — 9 citations into it; #2,346 of 12,182 by trust here, #4,199 by citations
- Signal Processing — 5 citations into it; #1,507 of 7,572 by trust here, #2,743 by citations
Whom Manuel Calimlim trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Roberto J. Bayardo Jr.
- Rakesh Agrawal
- Mohammed J. Zaki
- Pradeep Shenoy
- Charu C. Aggarwal
- Jiawei Han
- Karam Gouda
- Rayadurgam Srikant
- V. V. V. Prasad
- Jian Pei
Who trusts Manuel Calimlim overall
- Mohammed J. Zaki
- Karam Gouda
- Jiawei Han
- Gösta Grahne
- Ching-Jui Hsiao
- Jean-François Boulicaut
- Jianyong Wang
- Takeaki Uno
- Jun Huan
- Jay Ayres
Papers from Manuel Calimlim's perspective
Ordered by how strongly the researchers Manuel Calimlim trusts endorse each paper. Same corpus, a different order for every researcher.
- Efficiently mining long patterns from databases
- Mining association rules between sets of items in large databases
- Fast Discovery of Association Rules
- Depth first generation of long patterns (Knowledge Discovery and Data Mining)
- Mining the most interesting rules
- Turbo-charging vertical mining of large databases (ACM SIGMOD Conference)
- CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets (ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery)
- Scalable Algorithms for Association Mining
- The Nature of Statistical Learning Theory
- Attention is All you Need (Neural Information Processing Systems)
Their papers
- MAFIA: a maximal frequent itemset algorithm for transactional databases (2001) — 835 citations
- MAFIA: a maximal frequent itemset algorithm (2005) — 303 citations