( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mining Frequent k-Partite Episodes from Event Sequences.

, , и . JSAI-isAI Workshops, том 6284 из Lecture Notes in Computer Science, стр. 331-344. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Hiroki Takahashi

Hiroki Kawamura

Hiroki Sumizawa

 

Другие публикации лиц с тем же именем

Multi-Layered Framework for Modeling Relationships between Biased Objects., , и . SDM, стр. 819-827. SIAM, (2015)Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories., , и . KDIR/KMIS, стр. 143-151. SciTePress, (2013)Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism., и . IWOCA, том 6460 из Lecture Notes in Computer Science, стр. 68-81. Springer, (2010)Efficient Text Mining with Optimized Pattern Discovery.. CPM, том 2373 из Lecture Notes in Computer Science, стр. 17-19. Springer, (2002)Implementation of sequence BDDs in Erlang., , и . Erlang Workshop, стр. 90-91. ACM, (2011)Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries., , и . AII/ALT, том 872 из Lecture Notes in Computer Science, стр. 317-332. Springer, (1994)An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees., и . ILP, том 3625 из Lecture Notes in Computer Science, стр. 1-19. Springer, (2005)Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data.. ISCIS, том 62 из Lecture Notes in Electrical Engineering, стр. 353-358. Springer, (2010)Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing., , , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 100-A (9): 1785-1793 (2017)Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts., , , , и . Algorithmica, 82 (5): 1346-1377 (2020)