Andrea Pohoreckyj Danyluk

Publication Activity (10 Years)

Years Active: 1987-2020
Publications (10 Years): 2

Top Topics

Method For Feature Selection

Probabilistic Approaches

Bag Of Visual Words

Introductory Programming

Top Venues

Publications

Carla E. Brodley, Megan Barry, Aidan Connell, Catherine Gill, Ian Gorton, Benjamin Hescott, Bryan Lackaye, Cynthia LuBien, Leena Razzaq, Amit Shesh, Tiffani L. Williams, Andrea Pohoreckyj Danyluk
An MS in CS for non-CS Majors: Moving to Increase Diversity of Thought and Demographics in CS. SIGCSE (2020)
Lauren Jane Yu, Andrea Pohoreckyj Danyluk
Predicting Expressive Bow Controls for Violin and Viola. EvoMUSART (2017)
Andrea Pohoreckyj Danyluk, Nicholas Arnosti
Feature Selection via Probabilistic Outputs. ICML (2012)
David Andrew Moore, Andrea Pohoreckyj Danyluk
Deep Transfer as Structure Learning in Markov Logic Networks. Statistical Relational Artificial Intelligence (2010)
Douglas Baldwin, Alyce Brady, Andrea Pohoreckyj Danyluk, Joel C. Adams, A. Lawrence
Case Studies of Liberal Arts Computer Science Programs. ACM Trans. Comput. Educ. 10 (1) (2010)
Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh
Introducing concurrency in CS 1. SIGCSE (2010)
Andrea Pohoreckyj Danyluk
Artificial Intelligence for Non-Majors at Multiple Levels. AAAI Spring Symposium: Using AI to Motivate Greater Participation in Computer Science (2008)
Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh
Why structural recursion should be taught before arrays in CS 1. SIGCSE (2005)
Kim B. Bruce, Andrea Pohoreckyj Danyluk
Event-driven programming facilitates learning standard programming concepts. OOPSLA Companion (2004)
Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh
A library to support a graphics-based object-first approach to CS 1. SIGCSE (2001)
Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh
Event-driven programming is simple enough for CS1. ITiCSE (2001)
Brendan Davis Burns, Andrea Pohoreckyj Danyluk
Feature Selection vs Theory Reformulation: A Study of Genetic Refinement of Knowledge-based Neural Networks. Mach. Learn. 38 (1-2) (2000)
Foster J. Provost, Andrea Pohoreckyj Danyluk
Problem Definition, Data Cleaning, and Evaluation: A Classifier Learning Case Study. Informatica (Slovenia) 23 (1) (1999)
Christopher J. Merz, Michael J. Pazzani, Andrea Pohoreckyj Danyluk
Tuning Numeric Parameters to Troubleshoot a Telephone-Network Loop. IEEE Expert 11 (1) (1996)
Andrea Pohoreckyj Danyluk, Foster J. Provost
Small Disjuncts in Action: Learning to Diagnose Errors in the Local Loop of the Telephone Network. ICML (1993)
Andrea Pohoreckyj Danyluk
Finding New Rules for Incomplete Theories: Explicit Biases for Induction with Contextual Information. ML (1989)
Andrea Pohoreckyj Danyluk
The Use of Explanations for Similarity-based Learning. IJCAI (1987)