Arijit Khan

Arijit Khan

Auto-generated profile, based on publicly available information

Arijit Khan

Department of Computer Science, Aalborg University, Aalborg, Denmark

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2012
Verified
Conference Paper
Closed access
AKArijit Khan
Arijit Khan
XYXifeng Yan
Xifeng Yan
STShu Tao
Shu Tao
NANikos Anerousis
Nikos Anerousis
Cloud computing promises high scalability, flexibility and cost-effectiveness to satisfy emerging computing requirements. To efficiently provision computing resources in the cloud, system administrators need the capabilities of characterizing and predicting workload on the Virtual Machines (VMs). In this paper, we use data traces obtained from a real data center to develop such capabilities. First, we search for repeatable workload patterns by exploring cross-VM workload correlations resulted from the dependencies among applications running on different VMs. Treating workload data samples as time series, we develop a co-clustering technique to identify groups of VMs that frequently exhibit correlated workload patterns, and also the time periods in which these VM groups are active. Then, we introduce a method based on Hidden Markov Modeling (HMM) to characterize the temporal correlations in the discovered VM clusters and to predict variations of workload patterns. The experimental results show that our method can not only help better understand group-level workload characteristics, but also make more accurate predictions on workload changes in a cloud.

20 May 2012
Verified
Conference Paper
Open access
PDF file
SYShengqi Yang
Shengqi Yang
XYXifeng Yan
Xifeng Yan
BZBo Zong
Bo Zong
AKArijit Khan
Arijit Khan
Searching and mining large graphs today is critical to a variety of application domains, ranging from community detection in social networks, to de novo genome sequence assembly. Scalable processing of large graphs requires careful partitioning and distribution of graphs across clusters. In this paper, we investigate the problem of managing large-scale graphs in clusters and study access characteristics of local graph queries such as breadth-first search, random walk, and SPARQL queries, which are popular in real applications. These queries exhibit strong access locality, and therefore require specific data partitioning strategies. In this work, we propose a Self Evolving Distributed Graph Management Environment (Sedge), to minimize inter-machine communication during graph query processing in multiple machines. In order to improve query response time and throughput, Sedge introduces a two-level partition management architecture with complimentary primary partitions and dynamic secondary partitions. These two kinds of partitions are able to adapt in real time to changes in query workload. (Sedge) also includes a set of workload analyzing algorithms whose time complexity is linear or sublinear to graph size. Empirical results show that it significantly improves distributed graph processing on today's commodity clusters.

12 June 2011
Verified
Conference Paper
Open access
PDF file
AKArijit Khan
Arijit Khan
NLNan Li
Nan Li
XYXifeng Yan
Xifeng Yan
ZGZiyu Guan
Ziyu Guan
SCSupriyo Chakraborty
Supriyo Chakraborty
STShu Tao
Shu Tao

27 April 2015 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
NJNandish Jayaram
Nandish Jayaram
AKArijit Khan
Arijit Khan
CLChengkai Li
Chengkai Li
XYXifeng Yan
Xifeng Yan
RERamez Elmasri
Ramez Elmasri
We witness an unprecedented proliferation of knowledge graphs that record millions of entities and their relationships. While knowledge graphs are structure-flexible and content-rich, they are difficult to use. The challenge lies in the gap between their overwhelming complexity and the limited database knowledge of non-professional users. If writing structured queries over “simple” tables is difficult, complex graphs are only harder to query. As an initial step toward improving the usability of knowledge graphs, we propose to query such data by example entity tuples, without requiring users to form complex graph queries. Our system, Graph Query By Example (GQBE), automatically discovers a weighted hidden maximum query graph based on input query tuples, to capture a user's query intent. It then efficiently finds and ranks the top approximate matching answer graphs and answer tuples. We conducted experiments and user studies on the large Freebase and DBpedia datasets and observed appealing accuracy and efficiency. Our system provides a complementary approach to the existing keyword-based methods, facilitating user-friendly graph querying. To the best of our knowledge, there was no such proposal in the past in the context of graphs.

20 April 2020
Verified
Conference Paper
Open access
XLXi Tong Lee
Xi Tong Lee
AKArijit Khan
Arijit Khan
SGSourav Sen Gupta
Sourav Sen Gupta
YOYu Hann Ong
Yu Hann Ong
XLXuan Liu
Xuan Liu
Blockchains are increasingly becoming popular due to the prevalence of cryptocurrencies and decentralized applications. Ethereum is a distributed public blockchain network that focuses on running code (smart contracts) for decentralized applications. More simply, it is a platform for sharing information in a global state that cannot be manipulated or changed. Ethereum blockchain introduces a novel ecosystem of human users and autonomous agents (smart contracts). In this network, we are interested in all possible interactions: user-to-user, user-to-contract, contract-to-user, and contract-to-contract. This requires us to construct interaction networks from the entire Ethereum blockchain data, where vertices are accounts (users, contracts) and arcs denote interactions. Our analyses on the networks reveal new insights by combining information from the four networks. We perform an in-depth study of these networks based on several graph properties consisting of both local and global properties, discuss their similarities and differences with social networks and the Web, draw interesting conclusions, and highlight important, future research directions.

1 April 2018
Verified
Conference Paper
Closed access
SFShanshan Feng
Shanshan Feng
GCGao Cong
Gao Cong
AKArijit Khan
Arijit Khan
XLXiucheng Li
Xiucheng Li
YLYong Liu
Yong Liu
YCYeow Meng Chee
Yeow Meng Chee
As a fundamental problem in social influence propagation analysis, learning influence parameters has been extensively investigated. Most of the existing methods are proposed to estimate the propagation probability for each edge in social networks. However, they cannot effectively learn propagation parameters of all edges due to data sparsity, especially for the edges without sufficient observed propagation. Different from the conventional methods, we introduce a novel social influence embedding problem, which is to learn parameters for nodes rather than edges. Nodes are represented as vectors in a low-dimensional space, and thus social influence information can be reflected by these vectors. We develop a new model Inf2vec, which combines both the local influence neighborhood and global user similarity to learn the representations. We conduct extensive experiments on two real-world datasets, and the results indicate that Inf2vec significantly outperforms state-of-the-art baseline algorithms.