{"id":2,"date":"2018-11-13T13:41:05","date_gmt":"2018-11-13T13:41:05","guid":{"rendered":"http:\/\/groups.cs.umass.edu\/mlds\/?page_id=2"},"modified":"2020-07-11T15:40:57","modified_gmt":"2020-07-11T15:40:57","slug":"sample-page","status":"publish","type":"page","link":"https:\/\/groups.cs.umass.edu\/mlds\/","title":{"rendered":"Home"},"content":{"rendered":"

About the Lab<\/h2>\n

The MLDS lab focused on the development of machine learning models and algorithms for addressing a variety of challenging problems in the areas of computational social science, computational ecology, computational behavioral science and computational medicine.<\/p>\n

The MLDS lab’s research continues in multiple labs within the the College of Information and Computer Sciences including the REML lab<\/a>, the SLANG lab<\/a>, and Prof. Sheldon’s research group<\/a>.<\/p>\n

Publications<\/h2>\n
<\/a><\/form>
38 entries<\/span> «<\/a> ‹<\/a> 1 of 8 ›<\/a> »<\/a> <\/div><\/div>\r\n \r\n
\r\n

2017<\/h3>\r\n <\/td>\r\n <\/tr>

Dadkhahi, Hamid; Duarte, Marco F; Marlin, Benjamin M<\/p>

Out-of-Sample Extension for Dimensionality Reduction of Noisy Time Series Journal Article<\/span> <\/p>

In: <\/span>IEEE Transactions on Image Processing, <\/span>vol. 26, <\/span>no. 11, <\/span>pp. 5435\u20135446, <\/span>2017<\/span>.<\/p>

Abstract<\/a><\/span> | BibTeX<\/a><\/span><\/p>

@article{dadkhahi2017out,
\r\ntitle = {Out-of-Sample Extension for Dimensionality Reduction of Noisy Time Series},
\r\nauthor = {Hamid Dadkhahi and Marco F Duarte and Benjamin M Marlin},
\r\nyear  = {2017},
\r\ndate = {2017-01-01},
\r\njournal = {IEEE Transactions on Image Processing},
\r\nvolume = {26},
\r\nnumber = {11},
\r\npages = {5435\u20135446},
\r\npublisher = {IEEE},
\r\nabstract = {<p>This paper proposes an out-of-sample extension framework for a global manifold learning algorithm (Isomap) that uses temporal information in out-of-sample points in order to make the embedding more robust to noise and artifacts. Given a set of noise-free training data and its embedding, the proposed framework extends the embedding for a noisy time series. This is achieved by adding a spatio-temporal compactness term to the optimization objective of the embedding. To the best of our knowledge, this is the first method for out-of-sample extension of manifold embeddings that leverages timing information available for the extension set. Experimental results demonstrate that our out-of-sample extension algorithm renders a more robust and accurate embedding of sequentially ordered image data in the presence of various noise and artifacts when compared with other timing-aware embeddings. Additionally, we show that an out-of-sample extension framework based on the proposed algorithm outperforms the state of the art in eye-gaze estimation.<\/p>},
\r\nkeywords = {},
\r\npubstate = {published},
\r\ntppubtype = {article}
\r\n}
\r\n<\/pre><\/div>
Close<\/a><\/p><\/div>

Dadkhahi, Hamid; Marlin, Benjamin<\/p>

Learning Tree-Structured Detection Cascades for Heterogeneous Networks of Embedded Devices Proceedings<\/span> <\/p>

2017<\/span>, (<p>To appear.<\/p>)<\/span>.<\/p>

Abstract<\/a><\/span> | BibTeX<\/a><\/span><\/p>

@proceedings{291,
\r\ntitle = {Learning Tree-Structured Detection Cascades for Heterogeneous Networks of Embedded Devices},
\r\nauthor = {Hamid Dadkhahi and Benjamin Marlin},
\r\nyear  = {2017},
\r\ndate = {2017-01-01},
\r\njournal = {23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
\r\nabstract = {<p>In this paper, we present a new approach to learning cascaded classifiers for use in computing environments that involve networks of heterogeneous and resource-constrained, low-power embedded compute and sensing nodes. We present a generalization of the classical linear detection cascade to the case of tree-structured cascades where different branches of the tree execute on different physical compute nodes in the network. Different nodes have access to different features, as well as access to potentially different computation and energy resources. We concentrate on the problem of jointly learning the parameters for all of the classifiers in the cascade given a fixed cascade architecture and a known set of costs required to carry out the computation at each node. To accomplish the objective of joint learning of all detectors, we propose a novel approach to combining classifier outputs during training that better matches the hard cascade setting in which the learned system will be deployed. This work is motivated by research in the area of mobile health where energy efficient real time detectors integrating information from multiple wireless on-body sensors and a smart phone are needed for real-time monitoring and the delivery of just-in-time adaptive interventions. We evaluate our framework on mobile sensor-based human activity recognition and mobile health detector learning problems.<\/p>},
\r\nnote = {<p>To appear.<\/p>},
\r\nkeywords = {},
\r\npubstate = {published},
\r\ntppubtype = {proceedings}
\r\n}
\r\n<\/pre><\/div>
Close<\/a><\/p><\/div>

Adams, Roy J; Marlin, Benjamin M<\/p>

Learning Time Series Detection Models from Temporally Imprecise Labels<\/a> Conference<\/span> <\/p>

The 20th International Conference on Artificial Intelligence and Statistics, <\/span>2017<\/span>, (<p>n\/a<\/p>)<\/span>.<\/p>

Abstract<\/a><\/span> | Links<\/a><\/span> | BibTeX<\/a><\/span><\/p>

@conference{288,
\r\ntitle = {Learning Time Series Detection Models from Temporally Imprecise Labels},
\r\nauthor = {Roy J Adams and Benjamin M Marlin},
\r\nurl = {http:\/\/proceedings.mlr.press\/v54\/adams17a\/adams17a.pdf},
\r\nyear  = {2017},
\r\ndate = {2017-01-01},
\r\nbooktitle = {The 20th International Conference on Artificial Intelligence and Statistics},
\r\nabstract = {<p>In this paper, we consider a new low-quality label learning problem: learning time series detection models from temporally imprecise labels. In this problem, the data consist of a set of input time series, and supervision is provided by a sequence of noisy time stamps corresponding to the occurrence of positive class events. Such temporally imprecise labels commonly occur in areas like mobile health research where human annotators are tasked with labeling the occurrence of very short duration events. We propose a general learning framework for this problem that can accommodate different base classifiers and noise models. We present results on real mobile health data showing that the proposed framework significantly outperforms a number of alternatives including assuming that the label time stamps are noise-free, transforming the problem into the multiple instance learning framework, and learning on labels that were manually re-aligned. <\/p>},
\r\nnote = {<p>n\/a<\/p>},
\r\nkeywords = {},
\r\npubstate = {published},
\r\ntppubtype = {conference}
\r\n}
\r\n<\/pre><\/div>
Close<\/a><\/p><\/div>

Soha, Rostaminia; Addison, Mayberry; Deepak, Ganesan; Benjamin, Marlin; Jeremy, Gummeson<\/p>

iLid: Low-power Sensing of Fatigue and Drowsiness Measures on a Computational Eyeglass Journal Article<\/span> <\/p>

In: <\/span>Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, <\/span>vol. 1, <\/span>no. 2, <\/span>pp. 23, <\/span>2017<\/span>.<\/p>

Abstract<\/a><\/span> | BibTeX<\/a><\/span><\/p>

@article{soha2017ilid,
\r\ntitle = {iLid: Low-power Sensing of Fatigue and Drowsiness Measures on a Computational Eyeglass},
\r\nauthor = {Rostaminia Soha and Mayberry Addison and Ganesan Deepak and Marlin Benjamin and Gummeson Jeremy},
\r\nyear  = {2017},
\r\ndate = {2017-01-01},
\r\njournal = {Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies},
\r\nvolume = {1},
\r\nnumber = {2},
\r\npages = {23},
\r\npublisher = {ACM},
\r\nabstract = {<p>The ability to monitor eye closures and blink patterns has long been known to enable accurate assessment of fatigue and drowsiness in individuals. Many measures of the eye are known to be correlated with fatigue including coarse-grained measures like the rate of blinks as well as fine-grained measures like the duration of blinks and the extent of eye closures. Despite a plethora of research validating these measures, we lack wearable devices that can continually and reliably monitor them in the natural environment. In this work, we present a low-power system, iLid, that can continually sense fine-grained measures such as blink duration and Percentage of Eye Closures (PERCLOS) at high frame rates of 100fps. We present a complete solution including design of the sensing, signal processing, and machine learning pipeline; implementation on a prototype computational eyeglass platform; and extensive evaluation under many conditions including illumination changes, eyeglass shifts, and mobility. Our results are very encouraging, showing that we can detect blinks, blink duration, eyelid location, and fatigue-related metrics such as PERCLOS with less than a few percent error.<\/p>},
\r\nkeywords = {},
\r\npubstate = {published},
\r\ntppubtype = {article}
\r\n}
\r\n<\/pre><\/div>
Close<\/a><\/p><\/div>
\r\n

2016<\/h3>\r\n <\/td>\r\n <\/tr>

Bernstein, Garrett; Sheldon, Daniel R<\/p>

Consistently Estimating Markov Chains with Noisy Aggregate Data. Conference<\/span> <\/p>

AISTATS, <\/span>Cadiz, Spain, <\/span>2016<\/span>.<\/p>

BibTeX<\/a><\/span><\/p>

@conference{248,
\r\ntitle = {Consistently Estimating Markov Chains with Noisy Aggregate Data.},
\r\nauthor = {Garrett Bernstein and Daniel R Sheldon},
\r\nyear  = {2016},
\r\ndate = {2016-03-01},
\r\nbooktitle = {AISTATS},
\r\naddress = {Cadiz, Spain},
\r\nkeywords = {},
\r\npubstate = {published},
\r\ntppubtype = {conference}
\r\n}
\r\n<\/pre><\/div>
Close<\/a><\/p><\/div><\/td><\/tr><\/table>
38 entries<\/span> «<\/a> ‹<\/a> 1 of 8 ›<\/a> »<\/a> <\/div><\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
About the Lab The MLDS lab focused on the development of machine learning models and algorithms for addressing a variety of challenging problems in the areas of computational social science, computational ecology, computational behavioral science and computational medicine. The MLDS lab’s research continues in multiple labs within the the College of Information and Computer Sciences … Continue reading “Home”<\/span><\/a><\/p>\n","protected":false},"author":11,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-2","page","type-page","status-publish","hentry","no-sidebar","hfeed"],"_links":{"self":[{"href":"https:\/\/groups.cs.umass.edu\/mlds\/wp-json\/wp\/v2\/pages\/2","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/groups.cs.umass.edu\/mlds\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/groups.cs.umass.edu\/mlds\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/groups.cs.umass.edu\/mlds\/wp-json\/wp\/v2\/users\/11"}],"replies":[{"embeddable":true,"href":"https:\/\/groups.cs.umass.edu\/mlds\/wp-json\/wp\/v2\/comments?post=2"}],"version-history":[{"count":6,"href":"https:\/\/groups.cs.umass.edu\/mlds\/wp-json\/wp\/v2\/pages\/2\/revisions"}],"predecessor-version":[{"id":68,"href":"https:\/\/groups.cs.umass.edu\/mlds\/wp-json\/wp\/v2\/pages\/2\/revisions\/68"}],"wp:attachment":[{"href":"https:\/\/groups.cs.umass.edu\/mlds\/wp-json\/wp\/v2\/media?parent=2"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}