41. |
- Dupuch, Marie, et al.
(author)
-
Comparison of Clustering Approaches through Their Application to Pharmacovigilance Terms
- 2013
-
In: Artificial Intelligence in Medicine. Lecture Notes in Computer Science, vol. 7885. - Berlin Heidelberg : Springer. - 9783642383250 - 9783642383267 ; , s. 58-67
-
Book chapter (peer-reviewed)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.
|
|
42. |
- Engström, Christopher, 1987-, et al.
(author)
-
PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph
- 2016
-
In: Engineering Mathematics II. - Cham : Springer. - 9783319421049 - 9783319421056 ; , s. 223-247
-
Book chapter (peer-reviewed)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.
|
|
43. |
- Engström, Christopher, 1987-, et al.
(author)
-
PageRank, Connecting a Line of Nodes with a Complete Graph
- 2016
-
In: Engineering Mathematics II. - Cham : Springer. - 9783319421049 - 9783319421056
-
Book chapter (peer-reviewed)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.
|
|
44. |
- Freij, Ragnar, 1984, et al.
(author)
-
Partially ordered secretaries
- 2010
-
In: Electronic Communications in Probability. - 1083-589X. ; 15, s. 504-507
-
Journal article (peer-reviewed)abstract
- The elements of a finite nonempty partially ordered set are exposed at independent uniform times in [0, 1] to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector’s task is to choose online a maximal element. This generalizes the classical linear order secretary problem, for which it is known that the selector can succeed with probability 1=e and that this is best possible. We describe a strategy for the general problem that achieves success probability at least 1=e for an arbitrary partial order.
|
|
45. |
- Grezet, Matthias, et al.
(author)
-
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
- 2019
-
In: IEEE Transactions on Information Theory. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0018-9448 .- 1557-9654. ; 65:10, s. 6089-6100
-
Journal article (peer-reviewed)abstract
- Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been carried out to understand the optimal rate-distance tradeoff, but only recently the size of the alphabet has been taken into account. In this paper, a novel definition of locality is proposed to keep track of the precise number of nodes required for a local repair when the repair sets do not yield MDS codes. Then, a new alphabet-dependent bound is derived, which applies both to the new definition and the initial definition of locality. The new bound is based on consecutive residual codes and intrinsically uses the Griesmer bound. A special case of the bound yields both the extension of the Cadambe-Mazumdar bound and the Singleton-type bound for codes with locality (r, delta), implying that the new bound is at least as good as these bounds. Furthermore, an upper bound on the asymptotic rate-distance tradeoff of LRCs is derived, and yields the tightest known upper bound for large relative minimum distances. Achievability results are also provided by deriving the locality of the family of Simplex codes together with a few examples of optimal codes.
|
|
46. |
- Malmberg, Filip, et al.
(author)
-
An efficient algorithm for exact evaluation of stochastic watersheds
- 2014
-
In: Pattern Recognition Letters. - : Elsevier BV. - 0167-8655 .- 1872-7344. ; 47, s. 80-84
-
Journal article (peer-reviewed)abstract
- The stochastic watershed is a method for unsupervised image segmentation proposed by Angulo and Jeulin (2007). The method first computes a probability density function (PDF), assigning to each piece of contour in the image the probability to appear as a segmentation boundary in seeded watershed segmentation with randomly selected seeds. Contours that appear with high probability are assumed to be more important. This PDF is then post-processed to obtain a final segmentation. The main computational hurdle with the stochastic watershed method is the calculation of the PDF. In the original publication by Angulo and Jeulin, the PDF was estimated by Monte Carlo simulation, i.e., repeatedly selecting random markers and performing seeded watershed segmentation. Meyer and Stawiaski (2010) showed that the PDF can be calculated exactly, without performing any Monte Carlo simulations, but do not provide any implementation details. In a naive implementation, the computational cost of their method is too high to make it useful in practice. Here, we extend the work of Meyer and Stawiaski by presenting an efficient (quasi-linear) algorithm for exact computation of the PDF. We demonstrate that in practice, the proposed method is faster than any previously reported method by more than two orders of magnitude. The algorithm is formulated for general undirected graphs, and thus trivially generalizes to images with any number of dimensions.
|
|
47. |
- Alho, Artur, et al.
(author)
-
Multi-body Spherically Symmetric Steady States of Newtonian Self-Gravitating Elastic Matter
- 2019
-
In: Communications in Mathematical Physics. - : Springer Science and Business Media LLC. - 1432-0916 .- 0010-3616. ; 371:3, s. 975-1004
-
Journal article (peer-reviewed)abstract
- We study the problem of static, spherically symmetric, self-gravitating elastic matter distributions in Newtonian gravity. To this purpose we first introduce a new definition of homogeneous, spherically symmetric (hyper)elastic body in Euler coordinates, i.e., in terms of matter fields defined on the current physical state of the body. We show that our definition is equivalent to the classical one existing in the literature and which is given in Lagrangian coordinates, i.e. in terms of the deformation of the body from a given reference state. After a number of well-known examples of constitutive functions of elastic bodies are re-defined in our new formulation, a detailed study of the Seth model is presented. For this type of material the existence of single and multi-body solutions is established.
|
|
48. |
- Ames, Ellery, et al.
(author)
-
Cosmic string and black hole limits of toroidal Vlasov bodies in general relativity
- 2019
-
In: Physical Review D. - : AMER PHYSICAL SOC. - 2470-0010 .- 2470-0029. ; 99:2
-
Journal article (peer-reviewed)abstract
- We numerically investigate limits of a two-parameter family of stationary solutions to the Einstein-Vlasov system. The solutions are toroidal and have nonvanishing angular momentum. As the parameters are tuned to more relativistic solutions (measured e.g., by an increasing redshift) we provide evidence for a sequence of solutions which approaches the extreme Kerr black hole family. Solutions with angular momentum larger than the square of the mass are also investigated, and in the relativistic limit the near-field geometry of such solutions is observed to become locally rotationally symmetric about the matter density. The existence of a deficit angle in these regions is investigated.
|
|
49. |
|
|
50. |
|
|