九州工業大学 大学院情報工学研究院 知能情報工学研究系 知能数理学部門 坂本 比呂志 研究室

  • TOP
  • ENGLISH

業績

国際会議(査読付)

  • "Finding Ambiguous Patterns on Grammar Compressed String",
    Koji Maeda, Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto
    Workshop on Graph-Based Algorithms for Big Data and Its Applications (GABA2014), Springer post-proceedings, to appear.
  • "Online Pattern Matching for String Edit Distance with Moves",
    Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto,
    21th International Symposium on String Processing and Information Retrieval (SPIRE2014), 203-214.
  • "Improved ESP-index: A Practical Self-index for Highly Repetitive Texts",
    Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto,
    13th International Symposium on Experimental and Efficient Algorithms (SEA 2014), 338-350.
  • "Scalable Pattern Discovery on Knot Theory",
    Y. Takabatake, T. Kuboyama, A. Yasuhara, H. Sakamoto,
    Workshop on Data Discretization and Segmentation for Knowledge Discovery (DDS2013)
  • "An Implementation of Truss Decomposition of Bipartite Graph",
    Y. Li, T. Kuboyama, H. Sakamoto,
    Workshop on Data Discretization and Segmentation for Knowledge Discovery (DDS2013)
  • "Truss Decomposition for Extracting Communities in Bipartite Graph",
    Y. Li, T. Kuboyama, H. Sakamoto,
    The Third International Conference on Advances in Information Mining and Management (IMMM2013)
  • "A Reconfigurable Stream Compression Hardware based on Static Symbol-Lookup Table",
    S. Yamagiwa, H. Sakamoto,
    The First Workshop on Benchmarks, Performance Optimization, and Emerging hardware of Big Data Systems and Applications (BPOE 2013), 86-93.
  • "Fully-Online Grammar Compression",
    S. Maruyama, Y. Tabei, H. Sakamoto, K. Sadakane,
    20th International Symposium on String Processing and Information Retrieval (SPIRE2013), 218-229.
  • "Mining Twitter Data: Discover Quasi-Truss from Bipartite Graph",
    Y. Li, T. Kuboyama, H. Sakamoto,
    5th International Conference on Intelligent Decision Technologies, to appear
  • "A Succinct Grammar Compression",
    Y. Tabei, Y. Takabatake, H. Sakamoto,
    24th Annual Symposium on Combinatorial Pattern Matching (CPM2013), 235-246.
  • "Space-Efficient Grammar-Based Compression",
    Y. Takabatake, Y. Tabei, H. Sakamoto,
      Third Workshop on Algorithms for Large-Scale Information Processing in Knowledge Discovery (ALSIP 2012), abstract only.
  • "Mining twitter network: community extraction from tweets on the great east Japan earthquake",
    M. Matsumoto, Y. Yamadaki, T. Kuboyama, H. Sakamoto,
    IMMM 2012, poster.
  • "Variable-Length Codes for Space-Efficient Grammar-Based Compression",
    Y. Takabatake, Y. Tabei, H. Sakamoto,
    19th International Symposium on String Processing and Information Retrieval (SPIRE2012), 398-410.
  • "An Improvement of ESP-Index for Stream Data",
    Y. Takabatake, H. Sakamoto,
    The 5th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2012), abstract only.
  • "Grammar-Based Compression for Frequent Pattern Mining",
    M. Nakahara, S. Maruyama, T. Kuboyama, H. Sakamoto,
    Second Workshop on Algorithms for Large-Scale Information Processing in Knowledge Discovery (ALSIP 2011), abstract only.
  • "Scalable Detection of Frequent Substrings by Grammar-Based Compression",
    M.Nakahara, S.Maruyama, T.Kuboyama, H.Sakamoto,
    The 14th International Conference on Discovery Science (DS 2011), 236-246.
  • "ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing",
    S.Maruyama, M.Nakahara, N.Kishiue, H.Sakamoto,
    18th International Symposium on String Processing and Information Retrieval (SPIRE2011), 398-409.
  • "An Online Algorithm for Lightweight Grammar-Based Compression",
    S.Maruyama, T.Takeda, M.Nakahara, H.Sakamoto,
    1st International Conference on Data Compression, Communication, and Processing (CCP2011), 19-28.
  • "A Practical Random Access to Grammar-Based Compression",
    S.Maruyama, M.Baba, H.Sakamoto, K.Sadakane, M.Yamashita,
    The 4th Annual Meeting of Asian Association for Algorithms and Computation, abstract only.
  • "An Online Algorithm for Lightweight Compression of Highly Repetitive Text",
    S.Maruyama, M.akahara, H.Sakamoto,
    The 4th Annual Meeting of Asian Association for Algorithms and Computation, abstract only.
  • "Predicting Mutation Trend of Influenza A Virus through Dimensionality Reduction in Hamming Metric on HA Amino Acid Sequences"
    T.Kuboyama, K.Ito, K.Hirata, H.Sakamoto
    Annual International Conference on Bioinformatics and Computational Biology (BICB 2011), poster.
  • "An improved algorithm for extracting research communities from bibliographic data",
    Y.Nakamura, T.Horiike, Y.Taira, Hiroshi Sakamoto,
    Proc. DASFAA workshop, 338-345(2010-4).
  • "Extracting research communities by improved maximum flow algorithm",
    T.Horiike, Y.Takahashi, T.Kuboyama, H.Sakamoto,
    Proc. KES, 2:472-479(2009-9).
  • "Context-sensitive grammar transform: compression and pattern matching",
    S.Maruyama, Y.Tanaka, H.Sakamoto, M.Takeda,
    Proc. SPIRE, 27-38(2008-11).
  • "Move as multi-dominance and graph-theoretical linearization",
    T.Toyoshima, H.Sakamoto,
    Proc. BCGL3, 53-55(2008-5).
  • "Efficient reachability test on directed graphs and its application to large xml data",
    Y.Nakamura, T.Maita, H.Sakamoto, Proc. SWORD, CD-ROM(2007-4).
  • "Improving time and space complexity for compressed pattern matching",
    S.Maruyama, H.Miyagawa, H.Sakamoto,
    Proc. ISAAC, 484-493(2006-12).
  • "Fast reachability test on dags for xml",
    Y.Nakamura, T.Maita, H.Sakamoto,
    Proc. DMSS, 151-158(2006-9).
  • "A simple extension of queriable compression for xml data",
    T.Maita, H.Sakamoto,
    Proc. AMT, 91-95(2005-5).
  • "A space-saving linear-time algorithm for grammar-based compression",
    H.Sakamoto, T.Kida, S.Shimozono,
    Proc. SPIRE, 218-229(2004-10).
  • "A fully linear-time approximation algorithm for grammar-based compression",
    H.Sakamoto,
    Proc. CPM, 348-360(2003-6).
  • "Efficiently mining frequent substructures from semi-structured data",
    T.Asai, K.Abe, S.Kawasoe, H.Sakamoto, H.Arimura, S.Arikawa,
    Proc. IWIE, 59-64(2002-5).
  • "Efficient substructure discovery from large semi-structured Data",
    T.Asai, K.Abe, S.Kawasoe, H.Arimura, H.Sakamoto, S.Arikawa,
    Proc. SDM, 158-174(2002-4).
  • "Mining semi-structured data by path expressions",
    K.Taniguchi, H.Sakamoto, H.Arimura, S.Simozono, S.Arikawa,
    Proc. DS, 378-388(2001-11).
  • "Efficient learning of semi-structured data from queries",
    H.Arimura, H.Sakamoto, S.Arikawa,
    Proc. ALT, 315-331(2001-11).
  • "Prediction-preserving reducibility with membership queries on formal languages",
    K.Hirata, H.Sakamoto,
    Proc. FCT, 172-183(2001-8).
  • "Efficient discovery of proximity patterns with suffix arrays",
    H.Arimura, H.Asaka, H.Sakamoto, S.Arikawa,
    Proc. CPM, 152-156(2001-7).
  • "Extracting partial structures from html documents",
    H.Sakamoto, H.Arimura, S.Arikawa,
    Proc. AAAI FLAIRS Conference, 264-268(2001-5).
  • "Text data mining: discovery of important keywords in the cyberspace",
    H.Arimura, J.Abe, R.Fujino, H.Sakamoto, S.Shimozono, S.Arikawa,
    Proc. Kyoto DL 2000, 121-126(2000-11).
  • "Identification of tree translation rules from examples",
    H.Sakamoto, H.Arimura, S.Arikawa,
    Proc. ICGI, 241-255(2000-9).
  • "Learning term rewriting systems from entailment",
    H.Arimura, H.Sakamoto, S.Arikawa,
    Proc. Work-in-Progress reports of ILP, 19-32(2000-7).
  • "Intractability of decision problems for finite-memory automata",
    H.Sakamoto, D.Ikeda,
    Proc. MCU, 2:58-74(1998-3).
  • "Finding a one-variable pattern from incomplete data",
    H.Sakamoto,
    Proc. ALT, 234-246(1998-10).
  • "Learning simple deterministic finite-memory automata",
    H.Sakamoto,
    Proc. ALT, 416-431(1997-10).
  • "Language learning from membership queries and characteristic examples",
    H.Sakamoto,
    Proc. ALT, 55-65(1995-10).