3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2015
Finding HeavyPaths in Weighted Graphs and a Case-Study on Community Detection
Mohammad Khabbaz
A heavy path in a weighted graph represents a notion of connectivity and ordering that goes beyond two nodes. The heaviest path of length l in the graph, simply means a sequence of…
cs.DB2015
DataGrinder: Fast, Accurate, Fully non-Parametric Classification Approach Using 2D Convex Hulls
Mohammad Khabbaz
It has been a long time, since data mining technologies have made their ways to the field of data management. Classification is one of the most important data mining tasks for labe…
cs.DB2011★ 3 cited
Finding Heavy Paths in Graphs: A Rank Join Approach
Mohammad Khabbaz, Smriti Bhagat, Laks V. S. Lakshmanan
Graphs have been commonly used to model many applications. A natural problem which abstracts applications such as itinerary planning, playlist recommendation, and flow analysis in…