scispace - formally typeset
P

Padhraic Smyth

Researcher at University of California, Irvine

Publications -  359
Citations -  38795

Padhraic Smyth is an academic researcher from University of California, Irvine. The author has contributed to research in topics: Inference & Topic model. The author has an hindex of 80, co-authored 342 publications receiving 36653 citations. Previous affiliations of Padhraic Smyth include University of California & Jet Propulsion Laboratory.

Papers
More filters
Journal ArticleDOI

Quantifying the association between discrete event time series with applications to digital forensics

TL;DR: This work focuses in particular on the case where two associated event series exhibit temporal clustering such that the occurrence of one type of event at a particular time increases the likelihood that an event of the other type will also occur nearby in time.
Journal ArticleDOI

California wildfire spread derived using VIIRS satellite observations and an object-based tracking system

TL;DR: In this article , an object-based system for tracking the progression of individual fires using 375 m VISible Infrared Imaging Radiometer Suite active fire detections was developed, where fire pixels are clustered according to their spatial proximity, and are either appended to an existing active fire object or assigned to a new object.
Proceedings Article

An exploratory study of interdisciplinarity and breakthrough ideas

TL;DR: An exploratory study to understand how to measure the degree of interdisciplinarity involved in novel, significant research fields, and how those measures capture the integration of disparate ideas in novel configurations.
Proceedings Article

Statistical Models for Exploring Individual Email Communication Behavior

TL;DR: A latent variable modeling approach for extracting information from individual email histories, focusing in particular on understanding how an individual communicates over time with recipients in their social network is investigated.
Proceedings Article

Clustering Markov States into Equivalence Classes using SVD and Heuristic Search Algorithms.

TL;DR: A variety of greedy heuristic search algorithms that maximize the data likelihood are investigated and found to work well empirically, and are demonstrated on two applications: learning user models from traces of Unix commands, and word segmentation in language modeling.