Show simple item record

hal.structure.identifierUniversité de Bordeaux [UB]
dc.contributor.authorDRAMÉ, Khadim
hal.structure.identifierUniversité de Bordeaux [UB]
dc.contributor.authorMOUGIN, Fleur
hal.structure.identifierUniversité de Bordeaux [UB]
dc.contributor.authorDIALLO, Gayo
ORCID: 0000-0002-9799-9484
IDREF: 112800084
dc.date.accessioned2024-04-15T09:56:56Z
dc.date.available2024-04-15T09:56:56Z
dc.date.issued2016-07-27
dc.identifier.issn2041-1480
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198876
dc.description.abstractEnBackgroundWith the large and increasing volume of textual data, automated methods for identifying significant topics to classify textual documents have received a growing interest. While many efforts have been made in this direction, it still remains a real challenge. Moreover, the issue is even more complex as full texts are not always freely available. Then, using only partial information to annotate these documents is promising but remains a very ambitious issue. MethodsWe propose two classification methods: a k-nearest neighbours (kNN)-based approach and an explicit semantic analysis (ESA)-based approach. Although the kNN-based approach is widely used in text classification, it needs to be improved to perform well in this specific classification problem which deals with partial information. Compared to existing kNN-based methods, our method uses classical Machine Learning (ML) algorithms for ranking the labels. Additional features are also investigated in order to improve the classifiers’ performance. In addition, the combination of several learning algorithms with various techniques for fixing the number of relevant topics is performed. On the other hand, ESA seems promising for this classification task as it yielded interesting results in related issues, such as semantic relatedness computation between texts and text classification. Unlike existing works, which use ESA for enriching the bag-of-words approach with additional knowledge-based features, our ESA-based method builds a standalone classifier. Furthermore, we investigate if the results of this method could be useful as a complementary feature of our kNN-based approach.ResultsExperimental evaluations performed on large standard annotated datasets, provided by the BioASQ organizers, show that the kNN-based method with the Random Forest learning algorithm achieves good performances compared with the current state-of-the-art methods, reaching a competitive f-measure of 0.55% while the ESA-based approach surprisingly yielded reserved results.ConclusionsWe have proposed simple classification methods suitable to annotate textual documents using only partial information. They are therefore adequate for large multi-label classification and particularly in the biomedical domain. Thus, our work contributes to the extraction of relevant information from unstructured documents in order to facilitate their automated processing. Consequently, it could be used for various purposes, including document indexing, information retrieval, etc.
dc.language.isoen
dc.publisherBioMed Central
dc.title.enLarge scale biomedical texts classification: a kNN and an ESA-based approaches
dc.typeArticle de revue
dc.subject.halInformatique [cs]/Intelligence artificielle [cs.AI]
dc.identifier.arxiv1606.02976
bordeaux.journalJournal of Biomedical Semantics
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-01329565
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01329565v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Journal%20of%20Biomedical%20Semantics&rft.date=2016-07-27&rft.eissn=2041-1480&rft.issn=2041-1480&rft.au=DRAM%C3%89,%20Khadim&MOUGIN,%20Fleur&DIALLO,%20Gayo&rft.genre=article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record