Andrew C. Lee
Assistant Teaching Professor, SIS Undergraduate Program Coordinator
Electrical Engineering & Computer Science
Ph.D. (U. of Maryland, College Park, 1998); M.A. (U. of Maryland, College Park, 1996); M.A. (U. of Michigan, Ann Arbor, 1988); B.A. (U. of Hong Kong, 1987).
- Discrete Mathematics
- Computability Theory
- Computational Learning
- Artificial Intelligence
- Logic and Formal Methods
I study the role of queries and the associated learning strategies in solving computational problems. For example, the strategies for playing many board games and on-line games often resemble a basic paradigm in machine learning, namely, to learn a target concept via queries. By studying the (winning) strategies in specific concrete games, we may gain insights to determine the right set of queries and related parameters that are of interest in machine learning applications. I am also interested in graph coloring and graph labeling type problems. Many arise quite naturally in the study of social structures and networks. To better understand them it often requires new algorithms and analysis.
As an educator, I am interested in engaging students to do research. In addition, I like to explore new pedagogies to improve students’ reasoning ability, develop their inquisitiveness and strengthen their problem solving skills. Along in this direction I like to cast some of the research problems listed above in elementary settings and make them accessible to undergraduates and beginning graduate students.
- Artificial intelligence
- Data structures
- Automata and Computability
- Formal methods
Andrew C. Lee, Sin-Min Lee and Ho-Kun Ng, On the balance index set of bi-regular and tri-regular graphs, 78, Journal of Combinatorial Mathematics and Combinatorial Computing, August 2011, pp.169-186.
Man Kong, Andrew C. Lee and Sin-Min Lee, On the Balance Index Sets of Homeomorph of Regular Graphs, Congressus Numerantium, vol. 204, Dec. 2010, pp. 193-203.
Andrew C. Lee and Sin-Min Lee and Hsin-Hao Su, On the balanced indexed set of generalized friendship graphs, envelope graphs of cycles and cubic graphs, Congressus Numerantium, 196 (2009), pp. 3-22.
William I. Gasarch and Andrew C. Lee, Inferring answers to queries, Journal of Computing and Systems Sciences Volume 74, No 4, 2008, 490-512.