Research

Machine Learning Applied to Physics and Astronomy

Our research laboratory intends to provide state of the art techniques in the analysis of scientific data, with a particular emphasis in the fields of physics and astronomy. The laboratory comes in response to a time where massive amounts of data are being collected by a great variety of sensor devices (e.g., telescopes and satellites capturing a huge amount of images about our solar system and the entire universe). Such amount of data, readily available for processing and analysis, calls for algorithms that can search for meaningful patterns in an efficient form. Our current projects are the following:

Domain Adaptation Techniques Applied to Cepheid Variable Star Classification.

Automatic Classification of Supernovae.

Cluster Validation Applied to Current Star Taxonomies.

Learning to Classify Transients Across Astronomical Surveys.

Click here to see the laboratory website.

________________________________________________________________________________________________________________________


Metalearning: DData Characterization and Adaptive Learning Systems

In this project we try to understabd how meta-learning allows machine learning systems to benefit from their repetitive application. If a learning system fails to perform efficiently, one would expect the learning mechanism itself to adapt in case the same task is presented again. Metalearning differs from base-learning in the scope of the level of adaptation; whereas learning at the base-level is focused on accumulating experience on a specific task, learning at the metalevel is concerned with accumulating experience on the performance of multiple applications of a learning system. Briefly stated, the field of metalearning is focused on the relation between tasks or domains, and learning algorithms. Rather than starting afresh on each new task, metalearning facilitates evaluation and comparison of learning algorithms on many different previous tasks, establishes benefits and disadvantages, and then recommends the learning algorithm, or combination of algorithms, that maximizes some utility function on the new task. The utility or usefulness of a given learning algorithm is often determined through a mapping between a characterization of the task and the algorithm estimated performance. .

________________________________________________________________________________________________________________________

Previous Projects

Automatic Geomorphic Mapping and Analysis of Land Surfaces Using Pattern Recognition

This project seeks to develop a system for fast, objective and transparent conversion of topographic data into knowledge about land surfaces. Specifically the project has two complementary goals: 1) to develop a tool that autonomously produces geomorphic maps mimicking traditional, manually derived maps in their appearance and content, and 2) to develop a tool that classifies entire topographic scenes into characteristic landscape classes. The mapping tool is based on the object-oriented supervised classification principle. A number of novel solutions, including semi-supervised learning, meta-learning, and a wrapping technique coupling classification and segmentation, are proposed to address challenges posed by the specificity of topographic data. Collaborator: Dr. Tomasz Stepinski, Lunar and Planetary Institute.

Click here to see the project website.


           

 

_______________________________________________________________________________________________________

Current Address: Department of Computer Science, University of Houston, 4800 Calhoun Rd, Houston TX 77204-3010
Phone: (713) 743-3614 - Fax: (713) 743-3335 (attn. R. Vilalta)