|
[1]N. H. Nie and L. Erbring, “Internet and society: A preliminary report,” IT & society, vol. 1, no. 1, pp. 275-283, 2002. [2]VERISIGN, “The Domain Name Industry Brief,” 2019, vol. 16 issue 2. Accessed: 2019 Jun. 30. [Online]. Available: https://www.verisign.com/assets/domain-name-report-Q12019.pdf [3]“ICANN.” ICANN. https://www.icann.org/ (accessed Jun. 30, 2019). [4]“I Am New to ICANN – Now What?” ICANN. https://www.icann.org/newcomers (accessed Jun. 30, 2019). [5]“Cheers to the Multistakeholder Community.” ICANN. https://www.icann.org/news/blog/cheers-to-the-multistakeholder-community (accessed Jun. 30, 2019). [6]“Final Implementation Update.” ICANN. https://www.icann.org/news/blog/final-implementation-update (accessed Jun. 30, 2019). [7]“Stewardship of IANA Functions Transitions to Global Internet Community as Contract with U.S. Government Ends.” ICANN. https://www.icann.org/news/announcement-2016-10-01-en (accessed Jun. 30, 2019). [8]“Statement of Assistant Secretary Strickling on IANA Functions Contract.” National Telecommunications and Information Administration. https://www.ntia.doc.gov/press-release/2016/statement-assistant-secretary-strickling-iana-functions-contract (accessed Jun. 30, 2019). [9]“Announcements.” ICANN. https://www.icann.org/news/announcements (accessed Jun. 30, 2019). [10]D. J. Power, “What is the “true story” about using data mining to identify a relationship between sales of beer and diapers?,” DSS News, November, vol. 10, 2002. [11]R. Agrawal and R. Srikant, “Fast algorithms for mining association rules,” in Proc. 20th int. conf. very large data bases, VLDB, 1994, vol. 1215, pp. 487-499. [12]G. Piatetsky-Shapiro, “Discovery, analysis, and presentation of strong rules,” Knowledge discovery in databases, pp. 229-238, 1991. [13]M. J. Zaki, “Scalable algorithms for association mining,” IEEE transactions on knowledge and data engineering, vol. 12, no. 3, pp. 372-390, 2000. [14]J. Han, J. Pei, and Y. Yin, “Mining frequent patterns without candidate generation,” in ACM sigmod record, 2000, vol. 29, no. 2: ACM, pp. 1-12. [15]“Association Rule Learning.” Wikipedia. https://en.wikipedia.org/wiki/Association_rule_learning (accessed Jun. 30, 2019). [16]R. Agrawal, T. Imieliński, and A. Swami, “Mining association rules between sets of items in large databases,” in Acm sigmod record, 1993, vol. 22, no. 2: ACM, pp. 207-216. [17]H.-C. Chen and S.-S. Kuo, “DoS attack pattern mining based on association rule approach for web server,” in International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2018: Springer, pp. 527-536. [18]“ICANN’s Multistakeholder Model.” ICANN. https://www.icann.org/community#groups (accessed Jun. 30, 2019). [19]“What Does ICANN Do?” ICANN. https://www.icann.org/resources/pages/what-2012-02-25-en (accessed Jun. 30, 2019). [20]“Root Zone Database.” IANA. https://www.iana.org/domains/root/db (accessed Jun. 30, 2019). [21]“Generic top-level domain.” Wikipedia. https://en.wikipedia.org/wiki/Generic_top-level_domain (accessed Jun. 30, 2019). [22]“Mlxtend.” Sebastian Raschka. http://rasbt.github.io/mlxtend/ (accessed Jun. 30, 2019). [23]S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, “Dynamic itemset counting and implication rules for market basket data,” Acm Sigmod Record, vol. 26, no. 2, pp. 255-264, 1997. [24]K. Hornik, B. Grün, and M. Hahsler, “arules-A computational environment for mining association rules and frequent item sets,” Journal of Statistical Software, vol. 14, no. 15, pp. 1-25, 2005. [25]C. Castillo, “Effective Web Crawling,” Ph. D., Computer Science, University of Chile, 2004.
|