Practical algorithms for pattern based linear regression

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

1 被引用数 (Scopus)

抄録

We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation between the number of occurrences of the pattern in each string, and the numeric attribute value assigned to the string. We present two algorithms based on suffix trees, that can find the optimal substring pattern in O(Nn) and O(N 2) time, respectively, where n is the number of strings and N is their total length. We further present a general branch and bound strategy that can be used when considering more complex pattern classes. We also show that combining the O(N 2) algorithm and the branch and bound heuristic increases the efficiency of the algorithm considerably.

本文言語英語
ホスト出版物のタイトルDiscovery Science - 8th International Conference, DS 2005, Proceedings
ページ44-56
ページ数13
DOI
出版ステータス出版済み - 12月 1 2005
イベント8th International Conference on Discovery Science, DS 2005 - , シンガポール
継続期間: 10月 8 200510月 11 2005

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3735 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他8th International Conference on Discovery Science, DS 2005
国/地域シンガポール
Period10/8/0510/11/05

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Practical algorithms for pattern based linear regression」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル