Analysis of online social network connections for identification of influential users: Survey and open research issues
Online social networks (OSNs) are structures that help users to interact, exchange, and
propagate new ideas. The identification of the influential users in OSNs is a significant …
propagate new ideas. The identification of the influential users in OSNs is a significant …
{Back-Propagating} system dependency impact for attack investigation
Causality analysis on system auditing data has emerged as an important solution for attack
investigation. Given a POI (Point-Of-Interest) event (eg, an alert fired on a suspicious file …
investigation. Given a POI (Point-Of-Interest) event (eg, an alert fired on a suspicious file …
A review of graph-based models for entity-oriented search
Entity-oriented search tasks heavily rely on exploiting unstructured and structured
collections. Moreover, it is frequent for text corpora and knowledge bases to provide …
collections. Moreover, it is frequent for text corpora and knowledge bases to provide …
Accuracy estimate and optimization techniques for SimRank computation
The measure of similarity between objects is a very useful tool in many areas of computer
science, including information retrieval. SimRank is a simple and intuitive measure of this …
science, including information retrieval. SimRank is a simple and intuitive measure of this …
Robust and scalable linked data reasoning incorporating provenance and trust annotations
In this paper, we leverage annotated logic programs for tracking indicators of provenance
and trust during reasoning, specifically focussing on the use-case of applying a scalable …
and trust during reasoning, specifically focussing on the use-case of applying a scalable …
Local approximation of pagerank and reverse pagerank
Z Bar-Yossef, LT Mashiach - Proceedings of the 17th ACM conference on …, 2008 - dl.acm.org
We consider the problem of approximating the PageRank of a target node using only local
information provided by a link server. This problem was originally studied by Chen, Gan, and …
information provided by a link server. This problem was originally studied by Chen, Gan, and …
PageRank on Wikipedia: towards general importance scores for entities
A Thalhammer, A Rettinger - The Semantic Web: ESWC 2016 Satellite …, 2016 - Springer
Link analysis methods are used to estimate importance in graph-structured data. In that
realm, the PageRank algorithm has been used to analyze directed graphs, in particular the …
realm, the PageRank algorithm has been used to analyze directed graphs, in particular the …
A pagerank algorithm based on asynchronous gauss-seidel iterations
We address the PageRank problem of associating a relative importance value to all web
pages in the Internet so that a search engine can use them to sort which pages to show to …
pages in the Internet so that a search engine can use them to sort which pages to show to …
An approach to rank reviews by fusing and mining opinions based on review pertinence
Fusing and mining opinions from reviews posted in webs or social networks is becoming a
popular research topic in recent years in order to analyze public opinions on a specific topic …
popular research topic in recent years in order to analyze public opinions on a specific topic …
Counseling Responses for Mental Health Forum Questions with Early Maladaptive Schema Prediction
State-of-the-art Large Language Models (LLMs) have shown remarkable capabilities for
general Question Answering (QA) tasks. However, their practical use for answering mental …
general Question Answering (QA) tasks. However, their practical use for answering mental …