https://www.mdu.se/

mdu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Comparison of Clustering Approaches through Their Application to Pharmacovigilance Terms
CNRS UMR 8163 STL, Universit´e Lille 3, 59653 Villeneuve d’Ascq, France.
Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. (Mathematics/Applied Mathematics)ORCID iD: 0000-0002-1624-5147
Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. (Mathematics/Applied Mathematics)ORCID iD: 0000-0003-4554-6528
LIM&BIO UFR SMBH Universit´e Paris 13, France.
Show others and affiliations
2013 (English)In: Artificial Intelligence in Medicine. Lecture Notes in Computer Science, vol. 7885 / [ed] Niels Peek, Roque Marín Morales, Mor Peleg, Berlin Heidelberg: Springer, 2013, p. 58-67Chapter in book (Refereed)
Abstract [en]

In different applications (i.e., information retrieval, filteringor analysis), it is useful to detect similar terms and to provide the possibilityto use them jointly. Clustering of terms is one of the methods whichcan be exploited for this. In our study, we propose to test three methodsdedicated to the clustering of terms (hierarchical ascendant classification,Radius and maximum), to combine them with the semantic distance algorithmsand to compare them through the results they provide whenapplied to terms from the pharmacovigilance area. The comparison indicatesthat the non disjoint clustering (Radius and maximum) outperformthe disjoint clusters by 10 to up to 20 points in all the experiments.

Place, publisher, year, edition, pages
Berlin Heidelberg: Springer, 2013. p. 58-67
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7885
National Category
Natural Language Processing Computational Mathematics Probability Theory and Statistics Other Mathematics
Research subject
Mathematics/Applied Mathematics
Identifiers
URN: urn:nbn:se:mdh:diva-21680DOI: 10.1007/978-3-642-38326-7_9Scopus ID: 2-s2.0-84887296545ISBN: 978-3-642-38325-0 (print)ISBN: 978-3-642-38326-7 (print)OAI: oai:DiVA.org:mdh-21680DiVA, id: diva2:653509
Conference
14th Conference on Artificial Intelligence in Medicine
Note

14th Conference on Artificial Intelligence in Medicine, AIME 2013; Murcia; Spain; 29 May 2013 through 1 June 2013

Available from: 2013-10-04 Created: 2013-09-27 Last updated: 2025-02-01Bibliographically approved
In thesis
1. PageRank in Evolving Networks and Applications of Graphs in Natural Language Processing and Biology
Open this publication in new window or tab >>PageRank in Evolving Networks and Applications of Graphs in Natural Language Processing and Biology
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis is dedicated to the use of graph based methods applied to ranking problems on the Web-graph and applications in natural language processing and biology.

Chapter 2-4 of this thesis is about PageRank and its use in the ranking of home pages on the Internet for use in search engines. PageRank is based on the assumption that a web page should be high ranked if it is linked to by many other pages and/or by other important pages. This is modelled as the stationary distribution of a random walk on the Web-graph.

Due to the large size and quick growth of the Internet it is important to be able to calculate this ranking very efficiently. One of the main topics of this thesis is how this can be made more efficiently, mainly by considering specific types of subgraphs and how PageRank can be calculated or updated for those type of graph structures. In particular we will consider the graph partitioned into strongly connected components and how this partitioning can be utilized.

Chapter 5-7 is dedicated to graph based methods and their application to problems in Natural language processing. Specifically given a collection of texts (corpus) we will compare different clustering methods applied to Pharmacovigilance terms (5), graph based models for the identification of semantic relations between biomedical words (6) and modifications of CValue for the annotation of terms in a corpus.

In Chapter 8-9 we look at biological networks and the application of graph centrality measures for the identification of cancer genes. Specifically in (8) we give a review over different centrality measures and their application to finding cancer genes in biological networks and in (9) we look at how well the centrality of vertices in the true network is preserved in networks generated from experimental data.

Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2016
Series
Mälardalen University Press Dissertations, ISSN 1651-4238 ; 217
National Category
Mathematics
Research subject
Mathematics/Applied Mathematics
Identifiers
urn:nbn:se:mdh:diva-33459 (URN)978-91-7485-298-1 (ISBN)
Public defence
2016-12-08, Kappa, Mälardalens högskola, Västerås, 13:15 (English)
Opponent
Supervisors
Available from: 2016-10-24 Created: 2016-10-24 Last updated: 2016-11-23Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Engström, ChristopherSilvestrov, Sergei

Search in DiVA

By author/editor
Engström, ChristopherSilvestrov, Sergei
By organisation
Educational Sciences and Mathematics
Natural Language ProcessingComputational MathematicsProbability Theory and StatisticsOther Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 468 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf