| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| SWIM, SC | 2017-08-25 11:10 |
Tokyo | Dynamic Programming Method for Retrieving Similar Numerical Sequences
-- Application to Mining Stock Price Sequences -- Yoshihisa Udagawa (Tokyo Polytechnic Univ.)  SWIM2017-9 SC2017-14 |
The trend of stock price fluctuation continues with intermission of several days because stock prices tend to fluctuate ... [more] | SWIM2017-9 SC2017-14 pp.7-12 |
|
| ICSS, IPSJ-SPT | 2017-03-14 10:20 |
Nagasaki | University of Nagasaki | Attack Pattern Extraction by Clustering Parameters Shingo Orihara, Tohru Sato, Masaki Tanikawa (NTT) ICSS2016-60 |
Web Application Firewall (WAF) is widely used to detect attacks against Web applications. New sorts of attacks occurs da... [more] | ICSS2016-60 pp.123-128 |
| SWIM | 2017-02-24 16:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Detecting code clone using sequential data mining
-- Experimental results on Java SWING source code -- Yoshihisa Udagawa (Tokyo Polytechnic Univ.) SWIM2016-21 |
This paper proposes a method for applying a sequential data mining algorithm to detect code clones (duplicated code frag... [more] | SWIM2016-21 pp.17-22 |
| COMP | 2016-03-14 13:30 |
Fukuoka | Longest Common Subsequence Problem for Numerical Sequences by using Order-Isomorphic-Substrings Masatoshi Kurihara, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2015-38 |
The order-isomorphism can be used as a criteria for the similarity of numerical sequences. The order-preserving matching... [more] | COMP2015-38 pp.11-20 |
|
| SWIM | 2014-11-29 10:55 |
Tokyo | Tokyo Polytechnic Univ. | An Approach to Retrieving Structural Clones Using Sequence Mining Algorithms Yoshihisa Udagawa (Tokyo Polytechnic Univ.) SWIM2014-17 |
Several studies suggest that as much as 20—50% of large software in industry consist of copied fragments (clone co... [more] | SWIM2014-17 pp.15-22 |
| SS | 2013-05-09 17:20 |
Kagawa | Kagawa University (Saiwaimachi) | Dividing commits based on classification of modifications Noa Kusunoki, Keisuke Hotta, Yoshiki Higo, Shinji Kusumoto (Osaka Univ.) SS2013-6 |
Many researchers have mined software repositories to gain knowledge or principles that can encourage efficient software ... [more] | SS2013-6 pp.31-36 |
| COMP | 2011-05-11 13:35 |
Nagano | Shinshu Univ. | Algorithms for Computing Longest Common Substring/Subsequence on Non-Linear Texts Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2011-13 |
A non-linear text is a directed graph where each vertex is labeled with a string. In this paper, we define Longest comm... [more] |
COMP2011-13 pp.9-16 |
| MSS, CAS | 2007-11-30 15:45 |
Niigata | Niigata University | Finding a longest common subsequence of two twistable sequences Youhei Inoue, Toshihiko Takahashi (Niigata Univ.) CAS2007-83 CST2007-34 |
Finding a longest common subsequence (LCS) for two given sequences is called the LCS problem, which is classic and solve... [more] | CAS2007-83 CST2007-34 pp.55-58 |
| DE | 2006-07-12 14:05 |
Niigata | HOTEL SENKEI | Web Page Recommendation Using LCS Extracted from Web Log Analysis Rie Yamamoto, Dai Kobayashi, Takashi Kobayashi, Haruo Yokota (Tokyo Tec) |
Nowadays, the importance of the information transmission via websites leads to the explosive growth of the WWW, and ther... [more] | DE2006-40 pp.109-114 |
[Return to Top Page]