<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Sat, 26 Jul 2008 08:09:50 BST</pubDate>


	<title>CiteULike: vlachmore's Tsuruoka</title>
	<description>CiteULike: vlachmore's Tsuruoka</description>


	<link>http://www.citeulike.org/user/vlachmore/author/Tsuruoka</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/vlachmore/article/2670160"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/vlachmore/article/777825"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/vlachmore/article/1626506"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/vlachmore/article/1741179"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/vlachmore/article/2670160">
    <title>Normalizing biomedical terms by minimizing ambiguity and variability</title>
    <link>http://www.citeulike.org/user/vlachmore/article/2670160</link>
    <description>&lt;i&gt;BMC Bioinformatics, Vol. 9, No. Suppl 3. (2008)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;BACKGROUND:One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential variability of the terms. Soft string matching is a possible solution to the problem, but its inherent heavy computational cost discourages its use when the dictionaries are large or when real time processing is required. A less computationally demanding approach is to normalize the terms by using heuristic rules, which enables us to look up a dictionary in a constant time regardless of its size. The development of good heuristic rules, however, requires extensive knowledge of the terminology in question and thus is the bottleneck of the normalization approach.RESULTS:We present a novel framework for discovering a list of normalization rules from a dictionary in a fully automated manner. The rules are discovered in such a way that they minimize the ambiguity and variability of the terms in the dictionary. We evaluated our algorithm using two large dictionaries: a human gene/protein name dictionary built from BioThesaurus and a disease name dictionary built from UMLS.CONCLUSIONS:The experimental results showed that automatically discovered rules can perform comparably to carefully crafted heuristic rules in term mapping tasks, and the computational overhead of rule application is small enough that a very fast implementation is possible. This work will help improve the performance of term-concept mapping tasks in biomedical information extraction especially when good normalization heuristics for the target terminology are not fully known.</description>
    <dc:title>Normalizing biomedical terms by minimizing ambiguity and variability</dc:title>

    <dc:creator>Yoshimasa Tsuruoka</dc:creator>
    <dc:creator>John Mcnaught</dc:creator>
    <dc:creator>Sophia Ananiadou</dc:creator>
    <dc:identifier>doi:10.1186/1471-2105-9-S3-S2</dc:identifier>
    <dc:source>BMC Bioinformatics, Vol. 9, No. Suppl 3. (2008)</dc:source>
    <dc:date>2008-04-14T17:56:30-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:publicationName>BMC Bioinformatics</prism:publicationName>
    <prism:volume>9</prism:volume>
    <prism:number>Suppl 3</prism:number>
    <prism:category>bionlp</prism:category>
    <prism:category>gene</prism:category>
    <prism:category>normalization</prism:category>
    <prism:category>rules</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/vlachmore/article/777825">
    <title>Introduction to the bioentity recognition task at JNLPBA</title>
    <link>http://www.citeulike.org/user/vlachmore/article/777825</link>
    <description>&lt;i&gt;(2004)&lt;/i&gt;</description>
    <dc:title>Introduction to the bioentity recognition task at JNLPBA</dc:title>

    <dc:creator>Jin Kim</dc:creator>
    <dc:creator>Tomoko Ohta</dc:creator>
    <dc:creator>Yoshimasa Tsuruoka</dc:creator>
    <dc:creator>Yuka Tateisi</dc:creator>
    <dc:creator>Nigel Collier</dc:creator>
    <dc:source>(2004)</dc:source>
    <dc:date>2006-07-28T12:52:51-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:category>bionlp</prism:category>
    <prism:category>entity</prism:category>
    <prism:category>named</prism:category>
    <prism:category>recognition</prism:category>
    <prism:category>shared</prism:category>
    <prism:category>task</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/vlachmore/article/1626506">
    <title>Learning string similarity measures for gene/protein name dictionary look-up using logistic regression.</title>
    <link>http://www.citeulike.org/user/vlachmore/article/1626506</link>
    <description>&lt;i&gt;Bioinformatics (12 August 2007)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;MOTIVATION: One of the bottlenecks of biomedical data integration is variation of terms. Exact string matching often fails to associate a name with its biological concept, i.e. ID or accession number in the database, due to seemingly small differences of names. Soft string matching potentially enables us to find the relevant ID by considering the similarity between the names. However, the accuracy of soft matching highly depends on the similarity measure employed. RESULTS: We used logistic regression for learning a string similarity measure from a dictionary. Experiments using several large-scale gene/protein name dictionaries showed that the logistic regression-based similarity measure outperforms existing similarity measures in dictionary look-uptasks. AVAILABILITY: A dictionary look-up system using the similarity measures described in this paper is available at http://text0.mib.man.ac.uk/software/mldic/ CONTACT: yoshimasa.tsuruoka@manchester.ac.uk.</description>
    <dc:title>Learning string similarity measures for gene/protein name dictionary look-up using logistic regression.</dc:title>

    <dc:creator>Yoshimasa Tsuruoka</dc:creator>
    <dc:creator>John McNaught</dc:creator>
    <dc:creator>Jun'ichi Tsujii</dc:creator>
    <dc:creator>Sophia Ananiadou</dc:creator>
    <dc:identifier>doi:10.1093/bioinformatics/btm393</dc:identifier>
    <dc:source>Bioinformatics (12 August 2007)</dc:source>
    <dc:date>2007-09-06T11:54:19-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Bioinformatics</prism:publicationName>
    <prism:issn>1460-2059</prism:issn>
    <prism:category>bionlp</prism:category>
    <prism:category>gene</prism:category>
    <prism:category>name</prism:category>
    <prism:category>normalization</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/vlachmore/article/1741179">
    <title>Proceedings of International Joint Workshop on Natural Language Processing in Biomedicine and its Applications</title>
    <link>http://www.citeulike.org/user/vlachmore/article/1741179</link>
    <description>&lt;i&gt;(2004)&lt;/i&gt;</description>
    <dc:title>Proceedings of International Joint Workshop on Natural Language Processing in Biomedicine and its Applications</dc:title>

    <dc:source>(2004)</dc:source>
    <dc:date>2007-10-08T11:03:12-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:category>bionlp</prism:category>
    <prism:category>conditional</prism:category>
    <prism:category>crf</prism:category>
    <prism:category>entity</prism:category>
    <prism:category>fields</prism:category>
    <prism:category>named</prism:category>
    <prism:category>ner</prism:category>
    <prism:category>random</prism:category>
    <prism:category>recognition</prism:category>
</item>



</rdf:RDF>

