Skip to main content
Communication Theory Lab
CTL
Communication Theory Lab
Home
News
Events
People
All People
Principal Investigator
Research Scientists
Postdoctoral Fellows
Students
Visiting Scholars
Former Members
Former Members from Texas A&M University
Former Members from University of Minnesota
Collaborators
Alumni
Research
Publications
Teaching
Funding
Media
Contact Us
Frequent subgraph mining
InfoCloud published a paper in VLDB 2014 on "Grami: Frequent subgraph and pattern mining in a single large graph"
1 min read ·
Sat, Mar 1 2014
News
Frequent subgraph mining
InfoCloud published a paper in VLDB 2014 on "Grami: Frequent subgraph and pattern mining in a single large graph".
New Data Mining approach makes recurring patterns easier to be spotted
1 min read ·
Wed, Jan 18 2017
News
supercomputing
infoclouds
Frequent subgraph mining
algorithm
The ultimate answer is ScaleMine, cost-effective and agile scalable parallel frequent subgraph mining in a single large graph. Panagiotis Kalnis, Professor of Computer Science (CS), and the team from the KAUST Extreme Computing Research Center (ECRC), under the Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division signed this novel approach.
