Hiroki Arimura
Annual Symposium on Combinatorial Pattern Matching · 1993–2004
A researcher in the Science corpus: 3 papers; trusts 6 researchers and is trusted by 3 researchers here, as inferred from the citation graph.
Whom Hiroki Arimura trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Hiroki Arimura overall
Papers from Hiroki Arimura's perspective
Ordered by how strongly the researchers Hiroki Arimura trusts endorse each paper. Same corpus, a different order for every researcher.
- Efficiently mining long patterns from databases
- MAFIA: a maximal frequent itemset algorithm for transactional databases (Proceedings / International Conference on Data Engineering)
- Fast Discovery of Association Rules
- Mining frequent patterns without candidate generation
- Opportunistic data structures with applications
- Suffix arrays: a new method for on-line string searches
- Efficiently Using Prefix-trees in Mining Frequent Itemsets (Workshop on Frequent Itemset Mining Implementations)
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (Symposium on the Theory of Computing)
- A Block-sorting Lossless Data Compression Algorithm
- Fast Algorithms for Mining Association Rules in Large Databases