Pace University introduced an industry-based doctoral degree in Computing for senior full-time working professionals during the early 2000s. The Pace University Doctor of Professional Studies (D.P.S.) in Computing accepts these students, with several years of experience, into a weekend-based on campus doctoral program. Faculty with exceptional industry and academic based experience lead the D.P.S. program. This research examines the educational needs of students who have enrolled in the D.P.S. program. Specifically, the research reports on the responses to a survey sent to them. The survey queries past students on overall educational motivations, time constraints, budget constraints, job constraints, and research interests. Survey responses indicate that senior full-time working professionals chose the Pace University program based on the hybrid program structure, dissertation research relating to the student’s full-time working experience, location, and costs. The survey reports on major obstacles for this group (e.g., time, family, job, and funding), career advancement, average hours of full-time work per week, determining how the degree was funded (e.g., employer, loans, or personal), and length of time to complete degree. The results of the survey can be used to inform the needs of full-time industry experienced working professionals as they return to traditional degree program curriculum designs.
Keywords: Full-Time Working Professionals, Educational Needs, Computing;
References:
[1] S. S.-S. a. S. Ben-David, Understanding Machine Learning: From Theory to Algorithms, New York, NY: Cambridge University Press, 2014, pp. 5-19.
[2] T. M. Mitchell, Machines Learning, McGraw-Hill Science/Engineering/Math, 1997, pp. 2-8.
[3] H. Daumé III, A Course in Machine Learning, CIML License, 2012, pp. 51-60.
[4] J. B. MacQueen, "Some Methods for classification and Analysis of Multivariate Observations.," Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability. University of California Press., vol. MR 0214227. Zbl 0214.46201, p. pp. 281–297., 1967.
[5] E. Forgy, "Cluster analysis of multivariate data: efficiency versus interpretability of classifications," Biometrics, vol. JSTOR 2528559, p. 21: 768–769., 1965.
[6] I. Freeman, A. Haigler, S. Schmeelk, L. Ellrodt and T. Fields, (2018) "What are they Researching? Examining Industry-Based Doctoral Dissertation Research through the Lens of Machine Learning," 2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA), Orlando, FL, 2018, pp. 1338-1340.
[7] S.Cha, “Visualizing Hierarchical Clustering in Iterated Logarithmic Scales”, Pace CSIS Research Day, May 2009.
[8] J. A. Hartigan and M. A. Wong, "Algorithm AS 136: A K-Means Clustering Algorithm," Journal of the Royal Statistical Society, vol. Series C. 28 (1), p. 100–108, 1979.
[9] D. J. Rosenkrantz, R. E. Stearns and P. M. I. Lewis, "An analysis of several heuristics for the traveling salesman problem," SIAM Journal on Computing, vol. doi:10.1137/0206041, no. MR 0459617, p. 563–581, 1977.
[10] T. F. Gonzalez, "Clustering to minimize the maximum intercluster distance," Theoretical Computer Science, Vols. doi:10.1016/0304-3975(85)90224-5 , no. MR 0807927, p. 293–306, 1985.
[11] D. H. B. R. M. Rinal Doshi, "Development Of Pattern Knowledge Discovery Framework Using Clustering Data Mining Algorithm," International Journal of Computer Engineering & Technology (Ijcet), vol. Volume 4, no. Issue 3, pp. 101-112, 2013.
[12] N. L. D. R. A. P. Dempster, "Maximum Likelihood from Incomplete Data via the EM Algorithm," Journal of the Royal Statistical Society, vol. JSTOR 2984875, no. MR 0501537, pp. 1-38, 1977.
[13] C. F. J. Wu, "On the Convergence Properties of the EM Algorithm," Annals of Statistics, vol. JSTOR 2240463, no. MR 0684867, p. 95–103, 1983.
[14] M. R. G. Yihua Chen, "EM Demystified: An Expectation-Maximization Tutorial," Seattle, WA, 2010.
[15] Lisa R. Ellrodt, Ion C. Freeman, Ashley J. Haigler, and Suzanna E. Schmeelk. IEEE Frontiers in Education 2018.
[16] C. Forrest, "IBM launches Watson Discovery Service for big data analytics at scale," TechRepublic.
[17] Unknown, "Watson Discovery," IBM, [Online]. Available:
https://www.ibm.com/watson/services/discovery/. [Accessed 27 July 2018]
[18] IBM Corporation. Your data mine runs deep, so why only scratch the surface? 2018. On August 25, 2018, Retrieved from:
https://www.ibm.com/watson/whitepaper/discovery/
[19] IBM Corporation. The IBM Advantage for Cognitive Discovery Cloud Architecture. 2018. On August 25, 2018, Retrieved from:
https://www.ibm.com/cloud/garage/files/IBM-Advantage-Paper-for-Cognitive-Discovery.pdf
Pixel International Conferences
