Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Sokol, Marina"'
Autor:
Sokol, Marina
Les méthodes d'apprentissage semi-supervisé constituent une catégorie de méthodes d'apprentissage automatique qui combinent points étiquetés et données non labellisées pour construire le classifieur. Dans la première partie de la thèse, nou
Externí odkaz:
http://www.theses.fr/2014NICE4018/document
Personalized PageRank is an algorithm to classify the improtance of web pages on a user-dependent basis. We introduce two generalizations of Personalized PageRank with node-dependent restart. The first generalization is based on the proportion of vis
Externí odkaz:
http://arxiv.org/abs/1408.0719
A class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The original shortest-path betweenness centrality is based on counting shortest
Externí odkaz:
http://arxiv.org/abs/1308.2591
Our goal is to quickly find top $k$ lists of nodes with the largest degrees in large complex networks. If the adjacency list of the network is known (not often the case in complex networks), a deterministic algorithm to find a node with the largest d
Externí odkaz:
http://arxiv.org/abs/1202.3261
We develop a generalized optimization framework for graph-based semi-supervised learning. The framework gives as particular cases the Standard Laplacian, Normalized Laplacian and PageRank based methods. We have also provided new probabilistic interpr
Externí odkaz:
http://arxiv.org/abs/1110.4278
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and name disambiguation. In particular, we a
Externí odkaz:
http://arxiv.org/abs/1008.3775
Autor:
Avrachenkov, Konstantin, Litvak, Nelly, Nemirovsky, Danil, Smirnova, Elena, Sokol, Marina, Frieze, Alan, Horn, Paul, Pralat, Pawel
Publikováno v:
Algorithms and Models for the Web Graph: 8th International Workshop, WAW 2011, Atlanta, GA, USA, May 27-29, 2011. Proceedings, 50-61
STARTPAGE=50;ENDPAGE=61;TITLE=Algorithms and Models for the Web Graph
Lecture Notes in Computer Science ISBN: 9783642212857
WAW
STARTPAGE=50;ENDPAGE=61;TITLE=Algorithms and Models for the Web Graph
Lecture Notes in Computer Science ISBN: 9783642212857
WAW
We study a problem of quick detection of top-k Personalized PageRank (PPR) lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and person name disambiguation. We arg
Autor:
Sokol, Marina
Publikováno v:
Life & School: a Magazine for the Theory and Practice of Education / Život i škola : časopis za teoriju i praksu odgoja i obrazovanja; 2019, Vol. 65 Issue 1/2, p181-187, 7p
Publikováno v:
Bone Abstracts.