| 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)
-
Combining Compositionality and Pagerank for the Identification of Semantic Relations between Biomedical Words
- 2012
-
Ingår i: BioNLP. - 9781937284206 - 1937284204 ; , s. 109-117
-
Konferensbidrag (refereegranskat)abstract
- The acquisition of semantic resources and relations is an important task for several applications, such as query expansion, information retrieval and extraction, machine translation. However, their validity should also be computed and indicated, especially for automatic systems and applications. We exploit the compositionality based methods for the acquisition of synonymy relations and of indicators of these synonyms. We then apply pagerank-derived algorithm to the obtained semantic graph in order to filter out the acquired synonyms. Evaluation performed with two independent experts indicates that the quality of synonyms is systematically improved by 10 to 15% after their filtering.
|
|
| 3. |
- 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.
|
|
| 4. |
|
|
| 5. |
- 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.
|
|
| 6. |
- 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.
|
|
| 7. |
- Engström, Christopher, 1987-, et al.
(författare)
-
PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph
- 2016
-
Ingår i: Engineering Mathematics II. - Cham : Springer. - 9783319421049 - 9783319421056 ; , s. 223-247
-
Bokkapitel (refereegranskat)abstract
- In this article we will look at the PageRank algorithm used as part of the ranking process of different Internet pages in search engines by for example Google. This article has its main focus in the understanding of the behavior of PageRank as the system dynamically changes either by contracting or expanding such as when adding or subtracting nodes or links or groups of nodes or links. In particular we will take a look at link structures consisting of a line of nodes or a complete graph where every node links to all others. We will look at PageRank as the solution of a linear system of equations and do our examination in both the ordinary normalized version of PageRank as well as the non-normalized version found by solving corresponding linear system. We will show that using two different methods we can find explicit formulas for the PageRank of some simple link structures.
|
|
| 8. |
- Engström, Christopher, 1987-, et al.
(författare)
-
PageRank, Connecting a Line of Nodes with a Complete Graph
- 2016
-
Ingår i: Engineering Mathematics II. - Cham : Springer. - 9783319421049 - 9783319421056
-
Bokkapitel (refereegranskat)abstract
- The focus of this article is the PageRank algorithm originally defined by S. Brin and L. Page as the stationary distribution of a certain random walk on a graph used to rank homepages on the Internet. We will attempt to get a better understanding of how PageRank changes after you make some changes to the graph such as adding or removing edge between otherwise disjoint subgraphs. In particular we will take a look at link structures consisting of a line of nodes or a complete graph where every node links to all others and different ways to combine the two. Both the ordinary normalized version of PageRank as well as a non-normalized version of PageRank found by solving corresponding linear system will be considered. We will see that it is possible to find explicit formulas for the PageRank in some simple link structures and using these formulas take a more in-depth look at the behavior of the ranking as the system changes.
|
|
| 9. |
-
Engineering Mathematics II : Algebraic, Stochastic and Analysis Structures for Networks, Data Classification and Optimization
- 2016
-
Samlingsverk (redaktörskap) (refereegranskat)abstract
- This book highlights the latest advances in engineering mathematics with a main focus on the mathematical models, structures, concepts, problems and computational methods and algorithms most relevant for applications in modern technologies and engineering. It addresses mathematical methods of algebra, applied matrix analysis, operator analysis, probability theory and stochastic processes, geometry and computational methods in network analysis, data classification, ranking and optimisation.The individual chapters cover both theory and applications, and include a wealth of figures, schemes, algorithms, tables and results of data analysis and simulation. Presenting new methods and results, reviews of cutting-edge research, and open problems for future research, they equip readers to develop new mathematical methods and concepts of their own, and to further compare and analyse the methods and results discussed.The book consists of contributed chapters covering research developed as a result of a focused international seminar series on mathematics and applied mathematics and a series of three focused international research workshops on engineering mathematics organised by the Research Environment in Mathematics and Applied Mathematics at Mälardalen University from autumn 2014 to autumn 2015: the International Workshop on Engineering Mathematics for Electromagnetics and Health Technology; the International Workshop on Engineering Mathematics, Algebra, Analysis and Electromagnetics; and the 1st Swedish-Estonian International Workshop on Engineering Mathematics, Algebra, Analysis and Applications.It serves as a source of inspiration for a broad spectrum of researchers and research students in applied mathematics, as well as in the areas of applications of mathematics considered in the book.
|
|
| 10. |
|
|
