• Aucun résultat trouvé

Mining Graphs and Networks: A 15-Year Journey

N/A
N/A
Protected

Academic year: 2022

Partager "Mining Graphs and Networks: A 15-Year Journey"

Copied!
1
0
0

Texte intégral

(1)

Mining Graphs and Networks: A 15-Year Journey

Jian Pei

Simon Fraser University

Abstract

As graph and network mining being a hot topic nowadays, in this talk, I will present a brief review of the 15 years research in my group on this topic. I will talk about how we started from building graph databases and graph indexes in 2004, and discuss the topics we researched includ- ing graph construction, graph databases, specialized graph databases (e.g., geographical networks and social networks), graph query answer- ing, pattern mining in graphs, information ow and in uence analysis on graphs, privacy preservation in social networks, machine learning on graphs from conventional classification and clustering to network embedding. From this relatively short and biased memoir, I will try to summarize and share some experience and lessons on mining big data.

Biography:

Always eager to meet new challenges and opportunities, Jian Pei is currently a Canada Research Chair (Tier 1) in Big Data Science, a Professor in the School of Computing Science at Simon Fraser University, and an associate member of the Department of Statistics and Actuarial Science. Recognized as an ACM Fellow and an IEEE Fellow, he is a pioneering researcher in data science, big data, data mining, and database systems. He is also renowned for his active and productive professional leadership. He has over 200 technical publications, which have been cited by 75000+ times, 38000+ in the last 5 years. His research has generated remarkable impact substantially beyond academia, such as his algorithms being adopted by industry in production, by open source software suites in vogue likes Spark MLlib and WEKA, and by classical data mining textbooks. He is the recipient of the ACM SIGKDD 2017 Innovation Award and the IEEE ICDM 2014 Research Contributions Award, the highest awards for technical excellence in data science and data mining, and the ACM SIGKDD 2015 Service Award. He is the ACM SIGKDD Chair.

Copyrightc by the paper’s authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

Références

Documents relatifs

the graph formed by the set of WHERE triples of q SES has no arc disconnected from all ?N i S s nodes whose extents are used in the original-graph evaluation subplan, (We consider

We plan to design al- gorithms which intervene in the first phase of the process of cross-model data exchange, where, given some examples from the source database, the algorithms

We gave an overview of a provenance-based framework for routing queries, and of di↵erent approaches considered to lower the complexity of query evaluation: considering the shape of

This paper focus on query semantics on a graph database with constraints defined over a global schema and confidence scores as- signed to the local data sources (which compose

Given a graph and a goal query, we start with an empty sample and we continuously select a node that we ask the user to label, until the learned query selects exactly the same set

The user is interactively asked to visualize small fragments of the graph and to label nodes of interest as positive or negative, depending on whether or not she would like the nodes

Normally is not only any more incarnated in the subjectivity (understood here as a mental metaphor), but in the body matter, it is even incarnated in the subjectivation. To take

With a particular focus on metabolic engineering as an illustrative application domain, biochem4j, freely avail- able at http://biochem4j.org, is introduced to provide an