Mohammad Shokoohi-Yekta
Redmond, Washington, United States
14K followers
500+ connections
About
VP of AI with 10+ years of experience at FAANG companies. Delivered 100+ keynotes…
Activity
14K followers
Experience
Education
-
University of California, Riverside
-
-
Thesis: "Rule Discovery in Time Series." We introduce novel algorithms that allow us to quickly discover high quality rules in time series that accurately predict the occurrence of future events.
-
-
-
Volunteer Experience
-
Vice President of Student Affairs
Graduate Student Association, CSE Dept., UC Riverside
- 7 months
Politics
Publications
-
Clustering in the Face of Fast Changing Streams
SIAM International Conference on Data Mining (SDM 2016)
See publicationClustering is arguably the most important primitive for data mining, finding use as a subroutine in many higher-order algorithms. In recent years, the community has redirected its attention from the batch case to the online case. This need to support online clustering is engendered by the proliferation of cheap ubiquitous sensors that continuously monitor various aspects of our world, from heartbeats as we exercise to the number of mosquitoes visiting a well in a village in Ethiopia. In this…
Clustering is arguably the most important primitive for data mining, finding use as a subroutine in many higher-order algorithms. In recent years, the community has redirected its attention from the batch case to the online case. This need to support online clustering is engendered by the proliferation of cheap ubiquitous sensors that continuously monitor various aspects of our world, from heartbeats as we exercise to the number of mosquitoes visiting a well in a village in Ethiopia. In this work, we argue that current online clustering solutions offer a room for improvement. To some degree they all have at least one of the following shortcomings: they are parameter-laden, only defined for certain distance functions, sensitive to outliers, and/or they are approximate. This last point requires clarification; in some sense almost all clustering algorithms are approximate. For example, in general, k-means only approximately optimizes its objective function. However, streaming versions of the k-means algorithm are further approximating this approximation, potentially leading to very poor solutions. In this work, we introduce an algorithm that mitigates these flaws. It is parameter-lite, defined for any distance function, insensitive to outliers and produces the same output as the batch version of the algorithm. We demonstrate the utility and effectiveness of our ideas with case studies in entomology, cardiology and biological audio processing.
-
Generalizing Dynamic Time Warping to the MultiDimensional Case Requires an Adaptive Approach
Data Mining and Knowledge Discovery
Other authors -
-
Linear-time noise mining in large volumes of heart beat time series to predict death following heart attacks
presented as a poster at SDM
Other authors -
-
3D Sound Production in Virtual Reality Lab
first Professional Conference on Flight Simulation, Ministry of Science, Research and Technology
Patents
-
System and Method of Controlling Devices Using Motion Gestures
Issued US 62/738,339
Honors & Awards
-
IDEA Finalist at Apple
-
-
Dean’s Distinguished Fellowship, 2010-2012
-
-
Dissertation Year Program Fellowship, 2014
-
-
Faculty offer from University of San Diego, 2014
-
-
GAANN Fellowship, 2012 & 2013
-
-
Lifeguard Certificate, Life Saving Federation, Tehran, 2005
-
-
SIAM Scholarship, 2012
-
-
The Best Teaching Assistant Award for the Year, UCR, 2012
-
Languages
-
English
-
-
Persian
-
-
Arabic
-
-
Chinese
-
Recommendations received
4 people have recommended Mohammad
Join now to viewOther similar profiles
Explore top content on LinkedIn
Find curated posts and insights for relevant topics all in one place.
View top content