Text stream mining for Massive Open Online Courses: review and perspectives

REFERENCES

• C. C. Aggarwal (2011). An introduction to social network data analytics. In C. C. Aggarwal (Ed.), Social Network Data Analytics (pp. 1–15). New York, NY: Springer.
   Google Scholar
• C. C. Aggarwal (2012). Mining text streams. In C. C. Aggarwal & C. Zhai (Eds.), Mining text data (pp. 1–10). New York, NY: Springer.
   Google Scholar
• R. Agrawal, & R. Srikant (1994). Fast algorithms for mining association rules in large databases. Proceedings of the 20th international conference on very large data bases. VLDB’94 (pp. 487–499). San Francisco, CA: Morgan Kaufmann.
   Google Scholar
• C. Aggarwal, & C. Zhai (2012). A survey of text clustering algorithms. In C. C. Aggarwal & C. Zhai, C. (Eds.), Mining text data (pp. 77–128). New York, NY: Springer.
   Google Scholar
• C. C. Aggarwal, J. Han, J. Wang, & P. S. Yu (2003). A framework for clustering evolving data streams (pp. 81–92). Berlin: VLDB Endowment.
   Google Scholar
• J. Allan, S. Harding, D. Fisher, A. Bolivar, S. Guzman-Lara, & P. Amstutz (2005). Taking topic detection from evaluation to practice. Proceedings of the 38th annual Hawaii international conference on system sciences (HICSS’05) – Track 4 (Vol. 4, pp. 101–110). Washington, DC: IEEE Computer Society.
   Google Scholar
• J. Aslam, E. Pelekhov, & D. Rus (2006). The star clustering algorithm for information organization. In J. Kogan, C. Nicholas, & M. Teboulle (Eds.), Grouping Multidimensional Data (pp. 1–23). Berlin Heidelberg: Springer.
   Google Scholar
• J. Augustson, & J. Minker (1970). An analysis of some graph theoretical cluster techniques. Journal of the ACM, 17(4), 571–588. doi: 10.1145/321607.321608
   Web of Science ®Google Scholar
• F. Beil, M. Ester, & X. Xu (2002). Frequent term-based text clustering. Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining. KDD’02 (pp. 436–442). New York, NY: ACM.
   Google Scholar
• D. M. Blei (2012). Probabilistic topic models. Communications of the ACM, 55(4), 77–84. doi: 10.1145/2133806.2133826
   Web of Science ®Google Scholar
• D. M. Blei, A. Y. Ng, & M. I. Jordan (2003). Latent Dirichlet allocation. Journal of Machine Learning Research, 3, 993–1022.
   Web of Science ®Google Scholar
• L. B. Breslow, D. E. Pritchard, J. DeBoer, G. S. Stump, A. D. Ho, & D. T. Seaton (2013). Studying learning in the worldwide classroom: Research into edxs first MOOC. Research & Practice in Assessment, 8, 13–25.
   Google Scholar
• S. Cooper, & M. Sahami (2013). Reflections on Stanford's MOOCs. Communications of the ACM, 56(2), 28–30. doi: 10.1145/2408776.2408787
   Web of Science ®Google Scholar
• Coursera piazza report for db course. (2013). Retrieved from https://piazza.com/stats/report/hbtmlzostxhfc.
   Google Scholar
• D. R. Cutting, D. R. Karger, J. O. Pedersen, & J. W. Tukey (1992). Scatter/gather: A cluster-based approach to browsing large document collections. Proceedings of the 15th annual international ACM SIGIR conference on research and development in information retrieval. SIGIR’92 (pp. 318–329). New York, NY: ACM.
   Google Scholar
• J. Daniel (2012). Making sense of MOOCs: Musings in a maze of myth, paradox and possibility. Journal of Interactive Media in Education, 3(0). Retrieved October 17, 2013, from: http://www-jime.open.ac.uk/jime/article/viewArticle/2012-18/html
   Google Scholar
• I. S. Dhillon (2001). Co-clustering documents and words using bipartite spectral graph partitioning (pp. 269–274). Austin, TX: University of Texas. Retrieved from http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail\&id=oai%3Ancstrlh%3Autexas_cs%3AUTEXAS_CS%2F%2FCS-TR-01-05
   Google Scholar
• M. M. Gaber, A. Zaslavsky, & S. Krishnaswamy (2005). Mining data streams a review. SIGMOD Record, 34(2), 18–26. doi: 10.1145/1083784.1083789
   Web of Science ®Google Scholar
• J. Han, J. Pei, & Y. Yin (2000). Mining frequent patterns without candidate generation. SIGMOD Record, 29(2), 1–12. doi: 10.1145/335191.335372
   Web of Science ®Google Scholar
• Q. He, K. Chang, E. P. Lim, & A. Banerjee (2010). Keep it simple with time: A reexamination of probabilistic topic detection models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(10), 1795–1808. doi: 10.1109/TPAMI.2009.203
   PubMed Web of Science ®Google Scholar
• T. Hofmann (1999). Probabilistic latent semantic indexing. Proceedings of the 22nd annual international ACM SIGIR conference on research and development in information retrieval. SIGIR’99 (pp. 50–57). New York, NY: ACM.
   Google Scholar
• P. Hyman (2012). In the year of disruptive education. Communications of the ACM, 55(12), 20–22. doi: 10.1145/2380656.2380664
   Web of Science ®Google Scholar
• L. C. Kaczmarczyk (2013). MOOCs! ACM Inroads, 4(1), 19–20. doi: 10.1145/2432596.2432604
   Google Scholar
• R. Kop, H. Fournier, & J. Mak (2011). A pedagogy of abundance or a pedagogy to support human beings? Participant support on massive open online courses. International Review of Research in Open and Distance Learning, 12(7), 74–93.
   Google Scholar
• T. K. Landauer, D. S. Mcnamara, S. Dennis, & W. Kintsch (Eds.). (2007). Handbook of latent semantic analysis. Mahwah, NJ: Lawrence Erlbaum Associates.
   Google Scholar
• B. Liu (2007). Web data: mining exploring hyperlinks, contents, and usage data. Heidelberg, Berlin: Springer.
   Google Scholar
• Y. B. Liu, J. R. Cai, J. Yin, & A.W.-C. Fu (2008). Clustering text data streams. Journal of Computer Science and Technology, 23, 112–128. doi: 10.1007/s11390-008-9115-1
   Web of Science ®Google Scholar
• C. Luo, Y. Li, & S. M. Chung (2009). Text document clustering based on neighbors. Data Knowledge Engineering, 68(11), 1271–1288. Including special section: Conference on privacy in statistical databases (PSD 2008) six selected and extended papers on database privacy.) doi: 10.1016/j.datak.2009.06.007
   Web of Science ®Google Scholar
• J. G Mazoue. (2013). The MOOC model: Challenging traditional education. ELI 2013 online spring focus session 2013: Learning and the MOOC, EduCause Review Online. Retrieved from http://www.educause.edu/ero/article/mooc-model-challenging-traditional-education
   Google Scholar
• F. Murtagh, & P. Contreras (2012). Algorithms for hierarchical clustering: An overview. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 2(1), 86–97.
   Web of Science ®Google Scholar
• L. O'Callaghan, N. Mishra, A. Meyerson, S. Guha, & R. Motwani (2002). Streaming-data algorithms for high-quality clustering. Proceedings of the 18th international conference on data engineering (pp. 685–694). San Jose, CA.
   Google Scholar
• J. Parapar, & A. Barreiro (2008). Winnowing-based text clustering. In J. G. Shanahan, S. Amer-Yahia, I. Manolescu, Y. Zhang, D. A. Evans, A. Kolcz, … A. Chowdhury (Eds.), CIKM (pp. 1353–1354). New York, NY: ACM.
   Google Scholar
• S. Schleimer (2003). Winnowing: Local algorithms for document fingerprinting. Proceedings of the 2003 ACM SIGMOD international conference on management of data 2003 (pp. 76–85). New York, NY: ACM Press.
   Google Scholar
• S. Shatnawi, M. M. Gaber, & M. Cocea (2014). Automatic content related feedback for MOOCs based on course domain ontology. IDEAL. Lecture Notes in Computer Science. Springer. International Publishing AG, Cham. Retrieved from http://link.springer.com/chapter/10.1007%2F978-3-319-10840-7_4#page-1
   Google Scholar
• M. Steinbach, G. Karypis, & V. Kumar (2000). A comparison of document clustering techniques (Technical Report 00-034). University of Minnesota.
   Google Scholar
• Y. C. Tam, & T. Schultz (2008). Correlated bigram LSA for unsupervised language model adaptation. In D. Koller, D. Schuurmans, Y. Bengio, & L. Bottou (Eds.), NIPS (pp. 1633–1640). Vancouver, BC: Curran Associates.
   Google Scholar
• C. M. University Open Learning Initiative @Online (February 2013).
   Google Scholar
• M. Y. Vardi (2012). Will MOOCs destroy academia? Communications of the ACM, 55(11), 5–5. doi: 10.1145/2366316.2366317
   Web of Science ®Google Scholar
• M. Weller (2011). The digital scholar: How technology is transforming scholarly practice. London: A&C Black.
   Google Scholar
• H. M. Wallach (2006). Topic modeling: beyond bag-of-words. Proceedings of the 23rd international conference on machine learning. ICML’06 (pp. 977–984). New York, NY: ACM.
   Google Scholar
• I. H. Witten, & E. Frank (2005). Data mining: Practical machine learning tools and techniques (2nd ed.). Morgan Kaufmann Series in Data Management Systems. San Francisco, CA: Morgan Kaufmann.
   Google Scholar
• M. J. Zaki (2000). Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12, 372–390. doi: 10.1109/69.846291
   Web of Science ®Google Scholar
• C. Zhai (2008). Statistical language models for information retrieval. Synthesis Lectures on Human Language Technologies, 1(1), 1–141. doi: 10.2200/S00158ED1V01Y200811HLT001
   Google Scholar