5 citations · 10 across the 8 of their papers we have counts for
5 papers · 1 filter
-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches
Shunsuke Kanda, Yasuo Tabei
Recently, randomly mapping vectorial data to strings of discrete symbols (i.e., sketches) for fast and space-efficient similarity searches has become popular. Such random mapping i…
Dynamic Path-Decomposed Tries
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei +2
A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient impl…
Statistically Discriminative Sub-trajectory Mining
Vo Nguyen Le Duy, Takuto Sakuma, Taiju Ishiyama +7
We study the problem of discriminative sub-trajectory mining. Given two groups of trajectories, the goal of this problem is to extract moving patterns in the form of sub-trajectori…
Conversion from RLBWT to LZ77
Takaaki Nishimoto, Yasuo Tabei
Converting a compressed format of a string into another compressed format without an explicit decompression is one of the central research topics in string processing. We discuss t…
Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint
Yoshitaka Yamamoto, Yasuo Tabei, Koji Iwanuma
Here, we present a novel algorithm for frequent itemset mining for streaming data (FIM-SD). For the past decade, various FIM-SD methods in one-pass approximation settings have been…