| 1. |
- Andersson, Fredrik K., et al.
(författare)
-
The mathematics of internet search engines
- 2008
-
Ingår i: Acta Applicandae Mathematicae - An International Survey Journal on Applying Mathematics and Mathematical Applications. - : Springer. - 0167-8019 .- 1572-9036. ; 104:2, s. 211-242
-
Tidskriftsartikel (refereegranskat)abstract
- This article presents a survey of techniques for ranking results in search engines, with emphasis on link-based ranking methods and the PageRank algorithm. The problem of selecting, in relation to a user search query, the most relevant documents from an unstructured source such as the WWW is discussed in detail. The need for extending classical information retrieval techniques such as boolean searching and vector space models with link-based ranking methods is demonstrated. The PageRank algorithm is introduced, and its numerical and spectral properties are discussed. The article concludes with an alternative means of computing PageRank, along with some example applications of this new method.
|
|
| 2. |
- Hamon, Thierry, et al.
(författare)
-
Term Ranking Adaptation to the Domain : Genetic Algorithm-Based Optimisation of the C-Value
- 2014
-
Ingår i: Advances in Natural Language Processing. - Cham : Springer International Publishing. - 9783319108889 ; , s. 71-83
-
Konferensbidrag (refereegranskat)abstract
- Term extraction methods based on linguistic rules have been proposed to help the terminology building from corpora. As they face the difficulty of identifying the relevant terms among the noun phrases extracted, statistical measures have been proposed. However, the term selection results may depend on corpus and strong assumptions reflecting specific terminological practice. We tackle this problem by proposing a parametrised C-Value which optimally considers the length and the syntactic roles of the nested terms thanks to a genetic algorithm. We compare its impact on the ranking of terms extracted from three corpora. Results show average precision increased by 9% above the frequency-based ranking and by 12% above the C-Value-based ranking.
|
|
| 3. |
- Silvestrov, Sergei, 1970-
(författare)
-
Foundations of Santilli's Lie-Isotopic Theory
- 2010
-
Ingår i: Numerical Analysis and Applied Mathematics (AIP Conference Proceedings). - : American Institute of Physics (AIP). ; 1281, s. 860-863
-
Konferensbidrag (refereegranskat)abstract
- The need and benefits of new universal mathematical and especially algebraic and operator structures and methods in all branches and levels of modem physics from experiments to fundamentals is nowdays widely recognized. The far reaching pioneering discoveries of R. M. Santilli extend significantly the Lie analysis and operator methods and models of modem physics opening new areas of applications with possible essential improvements and revisions in models in particle physics and cosmology. In this article, some fundamental aspects of Lie-Santilli isotopic theory and relevant references are presented.
|
|
| 4. |
- Dupuch, Marie, et al.
(författare)
-
Comparison of Clustering Approaches through Their Application to Pharmacovigilance Terms
- 2013
-
Ingår i: Artificial Intelligence in Medicine. Lecture Notes in Computer Science, vol. 7885. - Berlin Heidelberg : Springer. - 9783642383250 - 9783642383267 ; , s. 58-67
-
Bokkapitel (refereegranskat)abstract
- 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.
|
|
| 5. |
|
|
