Login
Talks & Seminars
Title: Towards Querying and Mining of Large-Scale Networks (Faculty candidate talk)
Arijit Khan, University of California, Santa Barbara
Date & Time: August 12, 2013 10:30
Venue: CSE Office Conf. Room
Abstract:
With the advent of the internet, sources of data have increased dramatically, including the World Wide Web, social networks, knowledge graphs, medical and government records. These semi-structured data are usually represented as large networks with labeled nodes and edges. Querying and mining of these linked datasets are essential for a wide range of emerging applications, such as viral marketing, web search, malware detection, image retrieval, and social networks analysis. However, the complex combinations of structure and content, coupled with the massive volume of these data, raise several challenges that require new efforts for smarter and faster graph analysis. In this talk, I shall discuss two broad directions of my research: (1) querying of large-scale networks, including heterogeneous networks, uncertain and stream graphs, and (2) pattern mining over large graphs. In the domain of querying heterogeneous networks, due to noise and lack of schema, structured methods such as SPARQL — which require an underlying schema to formulate a query — are often too restrictive. Without knowing the exact structure of the data and the semantics of the entity labels and their relationships, can we still query them and obtain the relevant results? In addition, how do we query uncertain graphs and streams? In the area of graph pattern mining, what graph features one should extract in order to build an accurate and efficient classifier over large networks? From the perspective of advertising and viral marketing, what are the top-k most interesting itemsets and the top-k most influential persons in a social network? In this talk, I shall discuss our effective and efficient techniques to solve these emerging problems associated with querying and mining of complex Big-Graphs.
Speaker Profile:
Arijit Khan is a PhD student in the Department of Computer Science, University of California, Santa Barbara. He is currently working in Graph Querying and Mining. His PhD dissertation is focused on efficiently answering queries in large-scale social and information networks that are noisy and often lack a fixed schema. Arijit is the recipient of the prestigious IBM PhD Fellowship 2012-13.
List of Talks

Webmail

Username:
Password:
Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback