Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 3 of 3

Full-Text Articles in Computer Engineering

Information-Theoretic Model Diagnostics (Infomod), Armin Esmaeilzadeh May 2023

Information-Theoretic Model Diagnostics (Infomod), Armin Esmaeilzadeh

UNLV Theses, Dissertations, Professional Papers, and Capstones

Model validation is a critical step in the development, deployment, and governance of machine learning models. During the validation process, the predictive power of a model is measured on unseen datasets with a variety of metrics such as Accuracy and F1-Scores for classification tasks. Although the most used metrics are easy to implement and understand, they are aggregate measures over all the segments of heterogeneous datasets, and therefore, they do not identify the performance variation of a model among different data segments. The lack of insight into how the model performs over segments of unseen datasets has raised significant challenges …


Preprocessing Of Astronomical Images From The Neowise Survey For Near-Earth Asteroid Detection, Rachel Meyer Apr 2022

Preprocessing Of Astronomical Images From The Neowise Survey For Near-Earth Asteroid Detection, Rachel Meyer

Scholar Week 2016 - present

Asteroid detection is a common field in astronomy for planetary defense which requires observations from survey telescopes to detect and classify different objects. The amount of data collected each night is increasing as better designed telescopes are created each year. This amount is quickly becoming unmanageable and many researchers are looking for ways to better process this data. The dominant solution is to implement computer algorithms to automatically detect these sources and to use Machine Learning in order to create a more efficient and accurate classifier. In the past there has been a focus on larger asteroids that create streaks …


Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha Apr 2012

Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha

Research Collection School Of Computing and Information Systems

There is a significant body of empirical work on statistical de-anonymization attacks against databases containing micro-dataabout individuals, e.g., their preferences, movie ratings, or transactiondata. Our goal is to analytically explain why such attacks work. Specifically, we analyze a variant of the Narayanan-Shmatikov algorithm thatwas used to effectively de-anonymize the Netflix database of movie ratings. We prove theorems characterizing mathematical properties of thedatabase and the auxiliary information available to the adversary thatenable two classes of privacy attacks. In the first attack, the adversarysuccessfully identifies the individual about whom she possesses auxiliaryinformation (an isolation attack). In the second attack, the adversarylearns additional …