Recent Collaborators

ASU/CSE Awards

Top 5% Faculty Award, Fulton Schools of Engineering, 2014
Top 5% Faculty Award, Fulton Schools of Engineering, 2012

Best Teacher Award, Fulton Schools of Engineering, 2013
Best Teacher Award, Fulton Schools of Engineering, 2013

Top 5% Faculty Award, Fulton Schools of Engineering, 2012
Top 5% Faculty Award, Fulton Schools of Engineering, 2012

Distinguished Service'09
Distinguished Service in Computer Science and Engineering Award, 2009

Researcher of the Year'08
Researcher of the Year Award,2008

Service Faculty'07
Service Faculty of the Year Award, 2007

Jung's paper on locality-sensitive, re-use promoting PPR is accepted to the Knowledge and Information Systems Journal

Title: "Locality-Sensitive and Re-use Promoting Personalized PageRank Computations"

Authors: Jung Hyun Kim; K. Selçuk Candan; Maria Luisa Sapino

Abstract: Node distance/proximity measures are used for quantifying how nearby or otherwise
related two or more nodes on a graph are. In particular, PageRank (PPR) based measures of node
proximity have been shown to be highly effective in many prediction and recommendation applications.
Despite its effectiveness in prediction and recommendation applications, however, the
use of personalized PageRank for large graphs is difficult due to its high computation cost. In this
paper, we propose a Locality-sensitive, Re-use promoting, approximate Personalized PageRank
(LR-PPR) algorithm for efficiently computing the PPR values relying on the localities of the given
seed nodes on the graph: (a) The LR-PPR algorithm is locality sensitive in the sense that it reduces
the computational cost of the PPR computation process by focusing on the local neighborhoods
of the seed nodes. (b) LR-PPR is re-use promoting in that instead of performing a monolithic
computation for the given seed node set using the entire graph, LR-PPR divides the work into localities
of the seeds and caches the intermediary results obtained during the computation. These
cached results are then reused for future queries sharing seed nodes. Experiment results for different
data sets and under different scenarios show that LR-PPR algorithm is highly-efficient and

Short bio

K. Selcuk Candan is a Professor of Computer Science and Engineering at the School of Computing, Informatics, and Decision Science Engineering at the Arizona State University and is leading the EmitLab research group. He joined the department in August 1997, after receiving his Ph.D. from the Computer Science Department at the University of Maryland at College Park.

Prof. Candan's primary research interest is in the area of management of non-traditional, heterogeneous, and imprecise (such as multimedia, web, and scientific) data.  His various research projects in this domain are funded by diverse sources, including the National Science Foundation, Department of Defense, Mellon Foundation, and DES/RSA (Rehabilitation Services Administration). He has published over 140 articles and many book chapters. He has also authored 9 patents. Recently, he co-authored a book titled "Data Management for Multimedia Retrieval" for the Cambridge University Press and co-edited "New Frontiers in Information and Software as Services: Service and Application Design Challenges in the Cloud" for Springer.

Prof. Candan served an editorial board member of one of the most respected database journals, the Very Large Databases (VLDB) journal. He is currently an associate editor for the IEEE Transactions on Multimedia and the Journal of Multimedia. He has served in the organization and program committees of various conferences. In 2006, he served as an organization committee member for SIGMOD'06, the flagship database conference of the ACM and one of the best conferences in the area of management of data. In 2008, he served as a PC Chair for another leading, flagship conference of the ACM, this time focusing on multimedia research (MM'08). More recently, he served as a program committee group leader for ACM SIGMOD’10. He also served in the review board of the Proceedings of the VLDB Endowment (PVLDB). In 2011, he served in the Executive Committee of ACM SIGMM.

In 2010, he was a program co-chair for ACM CIVR'10 conference and a program group leader for ACM SIGMOD'10. In 2011, he is serving as a general co-chair for the ACM MM'11 conference. In 2012, he served as a general co-chair for ACM SIGMOD'12. In 2015, he will serve as a general co-chair for IEEE International Conference on Cloud Engineering (IC2E'15).

He is a member of the Executive Committee of ACM SIGMOD and an ACM Distinguished Scientist.

For his curriculum vitae, please click here.