Supervised Learning of Term Similarities

Irena Spasic; Goran Nenadic; Kostas Manios; Sophia Ananiadou

doi:10.1007/3-540-45675-9_64

Supervised Learning of Term Similarities

Irena Spasic, Goran Nenadic, Kostas Manios, Sophia Ananiadou

Natural Language Processing and Text Mining

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

Abstract

In this paper we present a method for the automatic discovery and tuning of term similarities. The method is based on the automatic extraction of significant patterns in which terms tend to appear. Beside that, we use lexical and functional similarities between terms to define a hybrid similarity measure as a linear combination of the three similarities. We then present a genetic algorithm approach to supervised learning of parameters that are used in this linear combination. We used a domain specific ontology to evaluate the generated similarity measures and set the direction of their convergence. The approach has been tested and evaluated in the domain of molecular biology.

Original language	English
Title of host publication	Intelligent Data Engineering and Automated Learning - IDEAL 2002
Subtitle of host publication	Third International Conference, Manchester, UK, August 12-14, Proceedings
Editors	Hujun Yin, Nigel M Allinson, Richard T Freeman, John A Keane, Simon J Hubbard
Publisher	Springer Nature
Pages	429-434
Number of pages	6
Volume	2412
ISBN (Print)	3-540-44025-9
DOIs	https://doi.org/10.1007/3-540-45675-9_64
Publication status	Published - 2002
Event	Third International Conference of Intelligent Data Engineering and Automated Learning - Manchester, United Kingdom Duration: 12 Aug 2002 → 14 Aug 2002

Publication series

Name	Lecture Notes in Computer Science
Number	2412

Conference

Conference	Third International Conference of Intelligent Data Engineering and Automated Learning
Abbreviated title	IDEAL 2002
Country/Territory	United Kingdom
City	Manchester
Period	12/08/02 → 14/08/02

Access to Document

10.1007/3-540-45675-9_64

Cite this

Spasic, I., Nenadic, G., Manios, K., & Ananiadou, S. (2002). Supervised Learning of Term Similarities. In H. Yin, N. M. Allinson, R. T. Freeman, J. A. Keane, & S. J. Hubbard (Eds.), Intelligent Data Engineering and Automated Learning - IDEAL 2002: Third International Conference, Manchester, UK, August 12-14, Proceedings (Vol. 2412, pp. 429-434). (Lecture Notes in Computer Science; No. 2412). Springer Nature. https://doi.org/10.1007/3-540-45675-9_64

Spasic, Irena ; Nenadic, Goran ; Manios, Kostas et al. / Supervised Learning of Term Similarities. Intelligent Data Engineering and Automated Learning - IDEAL 2002: Third International Conference, Manchester, UK, August 12-14, Proceedings. editor / Hujun Yin ; Nigel M Allinson ; Richard T Freeman ; John A Keane ; Simon J Hubbard. Vol. 2412 Springer Nature, 2002. pp. 429-434 (Lecture Notes in Computer Science; 2412).

@inproceedings{ed33a51a0784470bba11ffe6933d7f8b,

title = "Supervised Learning of Term Similarities",

abstract = "In this paper we present a method for the automatic discovery and tuning of term similarities. The method is based on the automatic extraction of significant patterns in which terms tend to appear. Beside that, we use lexical and functional similarities between terms to define a hybrid similarity measure as a linear combination of the three similarities. We then present a genetic algorithm approach to supervised learning of parameters that are used in this linear combination. We used a domain specific ontology to evaluate the generated similarity measures and set the direction of their convergence. The approach has been tested and evaluated in the domain of molecular biology.",

author = "Irena Spasic and Goran Nenadic and Kostas Manios and Sophia Ananiadou",

year = "2002",

doi = "10.1007/3-540-45675-9_64",

language = "English",

isbn = "3-540-44025-9",

volume = "2412",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature",

number = "2412",

pages = "429--434",

editor = "Hujun Yin and Allinson, {Nigel M} and Freeman, {Richard T} and Keane, {John A} and Hubbard, {Simon J}",

booktitle = "Intelligent Data Engineering and Automated Learning - IDEAL 2002",

address = "United States",

note = "Third International Conference of Intelligent Data Engineering and Automated Learning , IDEAL 2002 ; Conference date: 12-08-2002 Through 14-08-2002",

}

Spasic, I, Nenadic, G, Manios, K & Ananiadou, S 2002, Supervised Learning of Term Similarities. in H Yin, NM Allinson, RT Freeman, JA Keane & SJ Hubbard (eds), Intelligent Data Engineering and Automated Learning - IDEAL 2002: Third International Conference, Manchester, UK, August 12-14, Proceedings. vol. 2412, Lecture Notes in Computer Science, no. 2412, Springer Nature, pp. 429-434, Third International Conference of Intelligent Data Engineering and Automated Learning , Manchester, United Kingdom, 12/08/02. https://doi.org/10.1007/3-540-45675-9_64

Supervised Learning of Term Similarities. / Spasic, Irena; Nenadic, Goran; Manios, Kostas et al.
Intelligent Data Engineering and Automated Learning - IDEAL 2002: Third International Conference, Manchester, UK, August 12-14, Proceedings. ed. / Hujun Yin; Nigel M Allinson; Richard T Freeman; John A Keane; Simon J Hubbard. Vol. 2412 Springer Nature, 2002. p. 429-434 (Lecture Notes in Computer Science; No. 2412).

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

TY - GEN

T1 - Supervised Learning of Term Similarities

AU - Spasic, Irena

AU - Nenadic, Goran

AU - Manios, Kostas

AU - Ananiadou, Sophia

PY - 2002

Y1 - 2002

N2 - In this paper we present a method for the automatic discovery and tuning of term similarities. The method is based on the automatic extraction of significant patterns in which terms tend to appear. Beside that, we use lexical and functional similarities between terms to define a hybrid similarity measure as a linear combination of the three similarities. We then present a genetic algorithm approach to supervised learning of parameters that are used in this linear combination. We used a domain specific ontology to evaluate the generated similarity measures and set the direction of their convergence. The approach has been tested and evaluated in the domain of molecular biology.

AB - In this paper we present a method for the automatic discovery and tuning of term similarities. The method is based on the automatic extraction of significant patterns in which terms tend to appear. Beside that, we use lexical and functional similarities between terms to define a hybrid similarity measure as a linear combination of the three similarities. We then present a genetic algorithm approach to supervised learning of parameters that are used in this linear combination. We used a domain specific ontology to evaluate the generated similarity measures and set the direction of their convergence. The approach has been tested and evaluated in the domain of molecular biology.

U2 - 10.1007/3-540-45675-9_64

DO - 10.1007/3-540-45675-9_64

M3 - Conference contribution

SN - 3-540-44025-9

VL - 2412

T3 - Lecture Notes in Computer Science

SP - 429

EP - 434

BT - Intelligent Data Engineering and Automated Learning - IDEAL 2002

A2 - Yin, Hujun

A2 - Allinson, Nigel M

A2 - Freeman, Richard T

A2 - Keane, John A

A2 - Hubbard, Simon J

PB - Springer Nature

T2 - Third International Conference of Intelligent Data Engineering and Automated Learning

Y2 - 12 August 2002 through 14 August 2002

ER -

Spasic I, Nenadic G, Manios K, Ananiadou S. Supervised Learning of Term Similarities. In Yin H, Allinson NM, Freeman RT, Keane JA, Hubbard SJ, editors, Intelligent Data Engineering and Automated Learning - IDEAL 2002: Third International Conference, Manchester, UK, August 12-14, Proceedings. Vol. 2412. Springer Nature. 2002. p. 429-434. (Lecture Notes in Computer Science; 2412). doi: 10.1007/3-540-45675-9_64

Supervised Learning of Term Similarities

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this