Computational localization of transcription factor binding sites using extreme learning machines
Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, wh...
Ausführliche Beschreibung
Autor*in: |
Wang, Dianhui [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2012 |
---|
Schlagwörter: |
Feature-based location prediction |
---|
Anmerkung: |
© Springer-Verlag 2012 |
---|
Übergeordnetes Werk: |
Enthalten in: Soft computing - Springer-Verlag, 1997, 16(2012), 9 vom: 10. Feb., Seite 1595-1606 |
---|---|
Übergeordnetes Werk: |
volume:16 ; year:2012 ; number:9 ; day:10 ; month:02 ; pages:1595-1606 |
Links: |
---|
DOI / URN: |
10.1007/s00500-012-0820-x |
---|
Katalog-ID: |
OLC203487238X |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC203487238X | ||
003 | DE-627 | ||
005 | 20230502111621.0 | ||
007 | tu | ||
008 | 200820s2012 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s00500-012-0820-x |2 doi | |
035 | |a (DE-627)OLC203487238X | ||
035 | |a (DE-He213)s00500-012-0820-x-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
082 | 0 | 4 | |a 004 |q VZ |
084 | |a 11 |2 ssgn | ||
100 | 1 | |a Wang, Dianhui |e verfasserin |4 aut | |
245 | 1 | 0 | |a Computational localization of transcription factor binding sites using extreme learning machines |
264 | 1 | |c 2012 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a © Springer-Verlag 2012 | ||
520 | |a Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity. | ||
650 | 4 | |a DNA motifs | |
650 | 4 | |a Feature-based location prediction | |
650 | 4 | |a Imbalanced data classification | |
650 | 4 | |a Extreme learning machine ensembles | |
700 | 1 | |a Do, Hai Thanh |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Soft computing |d Springer-Verlag, 1997 |g 16(2012), 9 vom: 10. Feb., Seite 1595-1606 |w (DE-627)231970536 |w (DE-600)1387526-7 |w (DE-576)060238259 |x 1432-7643 |7 nnns |
773 | 1 | 8 | |g volume:16 |g year:2012 |g number:9 |g day:10 |g month:02 |g pages:1595-1606 |
856 | 4 | 1 | |u https://doi.org/10.1007/s00500-012-0820-x |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_267 | ||
912 | |a GBV_ILN_2018 | ||
912 | |a GBV_ILN_4277 | ||
951 | |a AR | ||
952 | |d 16 |j 2012 |e 9 |b 10 |c 02 |h 1595-1606 |
author_variant |
d w dw h t d ht htd |
---|---|
matchkey_str |
article:14327643:2012----::opttoalclztootasrpinatridnstssn |
hierarchy_sort_str |
2012 |
publishDate |
2012 |
allfields |
10.1007/s00500-012-0820-x doi (DE-627)OLC203487238X (DE-He213)s00500-012-0820-x-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Wang, Dianhui verfasserin aut Computational localization of transcription factor binding sites using extreme learning machines 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2012 Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity. DNA motifs Feature-based location prediction Imbalanced data classification Extreme learning machine ensembles Do, Hai Thanh aut Enthalten in Soft computing Springer-Verlag, 1997 16(2012), 9 vom: 10. Feb., Seite 1595-1606 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:16 year:2012 number:9 day:10 month:02 pages:1595-1606 https://doi.org/10.1007/s00500-012-0820-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 16 2012 9 10 02 1595-1606 |
spelling |
10.1007/s00500-012-0820-x doi (DE-627)OLC203487238X (DE-He213)s00500-012-0820-x-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Wang, Dianhui verfasserin aut Computational localization of transcription factor binding sites using extreme learning machines 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2012 Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity. DNA motifs Feature-based location prediction Imbalanced data classification Extreme learning machine ensembles Do, Hai Thanh aut Enthalten in Soft computing Springer-Verlag, 1997 16(2012), 9 vom: 10. Feb., Seite 1595-1606 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:16 year:2012 number:9 day:10 month:02 pages:1595-1606 https://doi.org/10.1007/s00500-012-0820-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 16 2012 9 10 02 1595-1606 |
allfields_unstemmed |
10.1007/s00500-012-0820-x doi (DE-627)OLC203487238X (DE-He213)s00500-012-0820-x-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Wang, Dianhui verfasserin aut Computational localization of transcription factor binding sites using extreme learning machines 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2012 Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity. DNA motifs Feature-based location prediction Imbalanced data classification Extreme learning machine ensembles Do, Hai Thanh aut Enthalten in Soft computing Springer-Verlag, 1997 16(2012), 9 vom: 10. Feb., Seite 1595-1606 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:16 year:2012 number:9 day:10 month:02 pages:1595-1606 https://doi.org/10.1007/s00500-012-0820-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 16 2012 9 10 02 1595-1606 |
allfieldsGer |
10.1007/s00500-012-0820-x doi (DE-627)OLC203487238X (DE-He213)s00500-012-0820-x-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Wang, Dianhui verfasserin aut Computational localization of transcription factor binding sites using extreme learning machines 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2012 Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity. DNA motifs Feature-based location prediction Imbalanced data classification Extreme learning machine ensembles Do, Hai Thanh aut Enthalten in Soft computing Springer-Verlag, 1997 16(2012), 9 vom: 10. Feb., Seite 1595-1606 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:16 year:2012 number:9 day:10 month:02 pages:1595-1606 https://doi.org/10.1007/s00500-012-0820-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 16 2012 9 10 02 1595-1606 |
allfieldsSound |
10.1007/s00500-012-0820-x doi (DE-627)OLC203487238X (DE-He213)s00500-012-0820-x-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Wang, Dianhui verfasserin aut Computational localization of transcription factor binding sites using extreme learning machines 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2012 Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity. DNA motifs Feature-based location prediction Imbalanced data classification Extreme learning machine ensembles Do, Hai Thanh aut Enthalten in Soft computing Springer-Verlag, 1997 16(2012), 9 vom: 10. Feb., Seite 1595-1606 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:16 year:2012 number:9 day:10 month:02 pages:1595-1606 https://doi.org/10.1007/s00500-012-0820-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 16 2012 9 10 02 1595-1606 |
language |
English |
source |
Enthalten in Soft computing 16(2012), 9 vom: 10. Feb., Seite 1595-1606 volume:16 year:2012 number:9 day:10 month:02 pages:1595-1606 |
sourceStr |
Enthalten in Soft computing 16(2012), 9 vom: 10. Feb., Seite 1595-1606 volume:16 year:2012 number:9 day:10 month:02 pages:1595-1606 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
DNA motifs Feature-based location prediction Imbalanced data classification Extreme learning machine ensembles |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Soft computing |
authorswithroles_txt_mv |
Wang, Dianhui @@aut@@ Do, Hai Thanh @@aut@@ |
publishDateDaySort_date |
2012-02-10T00:00:00Z |
hierarchy_top_id |
231970536 |
dewey-sort |
14 |
id |
OLC203487238X |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203487238X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502111621.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2012 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-012-0820-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203487238X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-012-0820-x-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wang, Dianhui</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational localization of transcription factor binding sites using extreme learning machines</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2012</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">DNA motifs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feature-based location prediction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Imbalanced data classification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Extreme learning machine ensembles</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Do, Hai Thanh</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">16(2012), 9 vom: 10. Feb., Seite 1595-1606</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:9</subfield><subfield code="g">day:10</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:1595-1606</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-012-0820-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2012</subfield><subfield code="e">9</subfield><subfield code="b">10</subfield><subfield code="c">02</subfield><subfield code="h">1595-1606</subfield></datafield></record></collection>
|
author |
Wang, Dianhui |
spellingShingle |
Wang, Dianhui ddc 004 ssgn 11 misc DNA motifs misc Feature-based location prediction misc Imbalanced data classification misc Extreme learning machine ensembles Computational localization of transcription factor binding sites using extreme learning machines |
authorStr |
Wang, Dianhui |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)231970536 |
format |
Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
1432-7643 |
topic_title |
004 VZ 11 ssgn Computational localization of transcription factor binding sites using extreme learning machines DNA motifs Feature-based location prediction Imbalanced data classification Extreme learning machine ensembles |
topic |
ddc 004 ssgn 11 misc DNA motifs misc Feature-based location prediction misc Imbalanced data classification misc Extreme learning machine ensembles |
topic_unstemmed |
ddc 004 ssgn 11 misc DNA motifs misc Feature-based location prediction misc Imbalanced data classification misc Extreme learning machine ensembles |
topic_browse |
ddc 004 ssgn 11 misc DNA motifs misc Feature-based location prediction misc Imbalanced data classification misc Extreme learning machine ensembles |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Soft computing |
hierarchy_parent_id |
231970536 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Soft computing |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 |
title |
Computational localization of transcription factor binding sites using extreme learning machines |
ctrlnum |
(DE-627)OLC203487238X (DE-He213)s00500-012-0820-x-p |
title_full |
Computational localization of transcription factor binding sites using extreme learning machines |
author_sort |
Wang, Dianhui |
journal |
Soft computing |
journalStr |
Soft computing |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2012 |
contenttype_str_mv |
txt |
container_start_page |
1595 |
author_browse |
Wang, Dianhui Do, Hai Thanh |
container_volume |
16 |
class |
004 VZ 11 ssgn |
format_se |
Aufsätze |
author-letter |
Wang, Dianhui |
doi_str_mv |
10.1007/s00500-012-0820-x |
dewey-full |
004 |
title_sort |
computational localization of transcription factor binding sites using extreme learning machines |
title_auth |
Computational localization of transcription factor binding sites using extreme learning machines |
abstract |
Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity. © Springer-Verlag 2012 |
abstractGer |
Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity. © Springer-Verlag 2012 |
abstract_unstemmed |
Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity. © Springer-Verlag 2012 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 |
container_issue |
9 |
title_short |
Computational localization of transcription factor binding sites using extreme learning machines |
url |
https://doi.org/10.1007/s00500-012-0820-x |
remote_bool |
false |
author2 |
Do, Hai Thanh |
author2Str |
Do, Hai Thanh |
ppnlink |
231970536 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s00500-012-0820-x |
up_date |
2024-07-03T22:48:08.041Z |
_version_ |
1803599885675528192 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203487238X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502111621.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2012 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-012-0820-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203487238X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-012-0820-x-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wang, Dianhui</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational localization of transcription factor binding sites using extreme learning machines</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2012</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Computational localization of transcription factor binding sites (TFBSs, also termed as motif instances) in DNA sequences greatly helps biologists in saving experimental cost and time for motif discovery. The task can be formulated as feature-based object location identification problem, which is remarkably different from traditional pattern recognition tasks. This paper aims to develop a machine learning approach for TFBSs location prediction through feature-based classifiers. Some specific features are extracted to characterize and distinguish the TFBSs from random k-mers. Then, a sampling technique is employed to generate dummy positives in the feature space for achieving better prediction performance. Three learner models are examined and a simple ensemble method is adopted in our classifiers design. Experimental results on eight benchmark datasets demonstrate that our proposed techniques have good potential for conserved motif detections. Comparative studies indicate that the extreme learning machine-based ensemble classifier outperforms the other learner models in terms of overall prediction accuracy and computational complexity.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">DNA motifs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feature-based location prediction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Imbalanced data classification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Extreme learning machine ensembles</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Do, Hai Thanh</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">16(2012), 9 vom: 10. Feb., Seite 1595-1606</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:9</subfield><subfield code="g">day:10</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:1595-1606</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-012-0820-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2012</subfield><subfield code="e">9</subfield><subfield code="b">10</subfield><subfield code="c">02</subfield><subfield code="h">1595-1606</subfield></datafield></record></collection>
|
score |
7.3987713 |