Sparse substring pattern set discovery using linear programming boosting

Kazuaki Kashihara; Kohei Hatano; Hideo Bannai; Masayuki Takeda

doi:10.1007/978-3-642-16184-1_10

Sparse substring pattern set discovery using linear programming boosting

Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem where each dimension corresponds to a substring pattern. Then we solve this problem by using LPBoost and an optimal substring discovery algorithm. Since the problem is a linear program, the resulting solution is likely to be sparse, which is useful for feature selection. We evaluate the proposed method for real data such as movie reviews.

Original language	English
Title of host publication	Discovery Science - 13th International Conference, DS 2010, Proceedings
Pages	132-143
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-16184-1_10
Publication status	Published - Dec 20 2010
Event	13th International Conference on Discovery Science, DS 2010 - Canberra, ACT, Australia Duration: Oct 6 2010 → Oct 8 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6332 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	13th International Conference on Discovery Science, DS 2010
Country/Territory	Australia
City	Canberra, ACT
Period	10/6/10 → 10/8/10

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-16184-1_10

Cite this

Kashihara, K., Hatano, K., Bannai, H., & Takeda, M. (2010). Sparse substring pattern set discovery using linear programming boosting. In Discovery Science - 13th International Conference, DS 2010, Proceedings (pp. 132-143). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6332 LNAI). https://doi.org/10.1007/978-3-642-16184-1_10

Sparse substring pattern set discovery using linear programming boosting. / Kashihara, Kazuaki; Hatano, Kohei; Bannai, Hideo et al.

Discovery Science - 13th International Conference, DS 2010, Proceedings. 2010. p. 132-143 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6332 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kashihara, K, Hatano, K, Bannai, H & Takeda, M 2010, Sparse substring pattern set discovery using linear programming boosting. in Discovery Science - 13th International Conference, DS 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6332 LNAI, pp. 132-143, 13th International Conference on Discovery Science, DS 2010, Canberra, ACT, Australia, 10/6/10. https://doi.org/10.1007/978-3-642-16184-1_10

Kashihara K, Hatano K, Bannai H, Takeda M. Sparse substring pattern set discovery using linear programming boosting. In Discovery Science - 13th International Conference, DS 2010, Proceedings. 2010. p. 132-143. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-16184-1_10

@inproceedings{84afe6e68ca344cf86e4e37dbe03b42f,

title = "Sparse substring pattern set discovery using linear programming boosting",

abstract = "In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem where each dimension corresponds to a substring pattern. Then we solve this problem by using LPBoost and an optimal substring discovery algorithm. Since the problem is a linear program, the resulting solution is likely to be sparse, which is useful for feature selection. We evaluate the proposed method for real data such as movie reviews.",

author = "Kazuaki Kashihara and Kohei Hatano and Hideo Bannai and Masayuki Takeda",

year = "2010",

month = dec,

day = "20",

doi = "10.1007/978-3-642-16184-1_10",

language = "English",

isbn = "3642161839",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "132--143",

booktitle = "Discovery Science - 13th International Conference, DS 2010, Proceedings",

note = "13th International Conference on Discovery Science, DS 2010 ; Conference date: 06-10-2010 Through 08-10-2010",

}

TY - GEN

T1 - Sparse substring pattern set discovery using linear programming boosting

AU - Kashihara, Kazuaki

AU - Hatano, Kohei

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2010/12/20

Y1 - 2010/12/20

N2 - In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem where each dimension corresponds to a substring pattern. Then we solve this problem by using LPBoost and an optimal substring discovery algorithm. Since the problem is a linear program, the resulting solution is likely to be sparse, which is useful for feature selection. We evaluate the proposed method for real data such as movie reviews.

AB - In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem where each dimension corresponds to a substring pattern. Then we solve this problem by using LPBoost and an optimal substring discovery algorithm. Since the problem is a linear program, the resulting solution is likely to be sparse, which is useful for feature selection. We evaluate the proposed method for real data such as movie reviews.

UR - http://www.scopus.com/inward/record.url?scp=78650100633&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650100633&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-16184-1_10

DO - 10.1007/978-3-642-16184-1_10

M3 - Conference contribution

AN - SCOPUS:78650100633

SN - 3642161839

SN - 9783642161834

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 132

EP - 143

BT - Discovery Science - 13th International Conference, DS 2010, Proceedings

T2 - 13th International Conference on Discovery Science, DS 2010

Y2 - 6 October 2010 through 8 October 2010

ER -

Sparse substring pattern set discovery using linear programming boosting

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this