Benjamin is a lecturer at Georgetown University where he teaches Data Science and Analytics with a focus on machine learning and Python software development. He is currently finishing his PhD in Computer Science at The University of Maryland at College Park, doing research in natural language processing for question and answer systems. His background includes significant professional and military experience beyond his academic work, and he has been a professional Python software developer for the past eight years and a professional data scientist since he earned his Master of Science, Computer Science from North Dakota State University in 2008. He is a board member of Data Community DC, and a faculty member of District Data Labs. His main research interests include natural language processing, multi-agent systems, knowledge goal reasoning, machine learning, distributed database systems, and graph analytics.
Leading Academic and Industry Experts
Mr. Benjamin Bengfort
Statistics.com Instructor Since
- B.A, Economics; International Economics, University of Maryland College Park
- M.S, Computer Science, North Dakota State University
- PhD, Computer Science, University of Maryland College Park 2017 (expected)
Data Analytics with Hadoop (Forthcoming). Bengfort, B., & Kim, J. (2015). O’Reilly Media, Inc.;
Interactive Knowledge-Goal Reasoning. In Goal Reasoning: Papers from the ACS Workshop (p. 10) (2015). Bengfort, B., & Cox, M. T.;
Hadoop Fundamentals for Data Scientists. (2015). O’Reilly Media, Inc. Bengfort, B.;
Evolutionary design of self-organizing particle systems for collective problem solving. In Swarm Intelligence (SIS), 2014 IEEE Symposium on (pp. 1–8). IEEE (2014). Bengfort, B., Kim, P. Y., Harrison, K., & Reggia, J. A.;
Practical Data Science Cookbook. Packt Publishing Ltd. (2014). Ojeda, T., Murphy, S. P., Bengfort, B., & Dasgupta, A0.;
Efficient resource allocation in Hybrid Wireless Networks. In Wireless Communications and Networking Conference (WCNC), (pp. 820–825). 2011 IEEE. Bengfort, B., Zhang, W., & Du, X.