BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Asia/Kolkata
X-WR-TIMEZONE:Asia/Kolkata
BEGIN:VEVENT
UID:26@cds.iisc.ac.in
DTSTART;TZID=Asia/Kolkata:20240104T150000
DTEND;TZID=Asia/Kolkata:20240104T160000
DTSTAMP:20240102T055638Z
URL:https://cds.iisc.ac.in/events/cloud-seminar-pattern-aware-graph-mining
 -abstractions-performance/
SUMMARY:[CLOUD SEMINAR] Pattern-Aware Graph Mining: Abstractions & Performa
 nce
DESCRIPTION:\n\nCLOUD COMPUTING SEMINAR SERIES\n\n\n\nTITLE: Pattern-Aware 
 Graph Mining: Abstractions &amp\; Performance\n\nSPEAKER: Prof. Keval Vora
 \, School of Computing Science\, Simon Fraser University\, Canada\n\nDATE/
 TIME: Thu Jan 4\, 3PM\n\nVENUE: CDS Seminar Room #102\n\n\n\nABSTRACT\n\nM
 odern graph mining applications like Motif Counting and Frequent Subgraph 
 Mining analyze the structural properties of graphs (i.e.\, rely on the sub
 graph isomorphism problem). These applications are not only computationall
 y expensive\, but are also difficult to express due to the complexities in
 volved in the nuanced structural constraints to satisfy the application re
 quirements.\n\nIn this talk\, I will give a flavor of the challenges invol
 ved and our recent efforts in developing scalable graph mining systems. I 
 will present our pattern-aware processing philosophy that enables easier e
 xpression of complex graph mining use cases\, enabling efficient pattern m
 atching strategies for fast subgraph exploration. Specifically\, I will di
 scuss the Anti-Vertex construct to easily express neighborhood constraints
  in subgraph queries. Then\, I will present Subgraph Morphing\, a general 
 technique that exploits structural similarities across different patterns 
 to accelerate graph mining systems.\n\nBIO\n\nKeval Vora is an Associate P
 rofessor at the School of Computing Science at Simon Fraser University. He
  received his Ph.D. from the Department of Computer Science and Engineerin
 g at the University of California\, Riverside where he was advised by Prof
 . Rajiv Gupta. He was also a visiting researcher at the University of Cali
 fornia\, Irvine where he worked with Prof. Harry Xu. His research addresse
 s challenges in building scalable modern data analytics systems\, with a f
 ocus on graph data processing and management. His work lies at the interse
 ction of runtime systems (often touching various parts of the technology s
 tack) and algorithmic semantics (to build smarter solutions). He specializ
 es in developing efficient techniques with provable guarantees for large-s
 cale graph systems.\n\nHost: Yogesh Simmhan\n\nAbout: The IBM-IISc Hybrid 
 Cloud Lab (IIHCL) hosted at IISc is curating the Cloud Computing Seminar s
 eries with guest speakers from Industry and Academia speaking about the la
 test technologies and research on Cloud and edge computing\, distributed c
 omputing systems\, and AI/ML/Big Data platforms.\n\n\n\nALL ARE WELCOME
CATEGORIES:Talks
END:VEVENT
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
X-LIC-LOCATION:Asia/Kolkata
BEGIN:STANDARD
DTSTART:20230104T150000
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
END:STANDARD
END:VTIMEZONE
END:VCALENDAR