82 citations · 195 across the 17 of their papers we have counts for
6 papers · 1 filter
Maximizing Contrasting Opinions in Signed Social Networks
Kaivalya Rawal, Arijit Khan
The classic influence maximization problem finds a limited number of influential seed users in a social network such that the expected number of influenced users in the network, fo…
Efficiently Embedding Dynamic Knowledge Graphs
Tianxing Wu, Arijit Khan, Melvin Yong +2
Knowledge graph (KG) embedding encodes the entities and relations from a KG into low-dimensional vector spaces to support various applications such as KG completion, question answe…
Semantic Guided and Response Times Bounded Top-k Similarity Search over Knowledge Graphs
Yuxiang Wang, Arijit Khan, Tianxing Wu +2
Recently, graph query is widely adopted for querying knowledge graphs. Given a query graph , the graph query finds subgraphs in a knowledge graph that exactly or approxima…
Distance-generalized Core Decomposition
Francesco Bonchi, Arijit Khan, Lorenzo Severini
The -core of a graph is defined as the maximal subgraph in which every vertex is connected to at least other vertices within that subgraph. In this work we introduce a dista…
An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs
Xiangyu Ke, Arijit Khan, Leroy Lim Hong Quan
Uncertain, or probabilistic, graphs have been increasingly used to represent noisy linked data in many emerging applications, and have recently attracted the attention of the datab…
Reliability Maximization in Uncertain Graphs
Xiangyu Ke, Arijit Khan, Mohammad Al Hasan +1
Network reliability measures the probability that a target node is reachable from a source node in an uncertain graph, i.e., a graph where every edge is associated with a probabili…