Big data analytics and business analytics

Journal of Management Analytics

Volumn 2, Issue 1, 2015, Pages 1-21

  Duan, Lian ^a   Xiong, Ye ^a  

^a New Jersey Institute of Technology   (United States)

Author keywords

big data analytics; business analytics; business intelligence; management analytics; marketing analytics

Indexed keywords

EID: 84979665325     PISSN: 23270012     EISSN: 23270039     Source Type: Journal    
DOI: 10.1080/23270012.2015.1020891     Document Type: Article

References (142)

1. Abbasi, A., Albrecht, C., Vance, A., & Hansen, J., (2012). Metafraud: A meta-learning framework for detecting financial fraud. MIS Quarterly, 36(4), 1293–1327.
2. Akaike, H., (1969). Fitting autoregressive models for prediction. Annals of the Institute of Statistical Mathematics, 21(1), 243–247.
3. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E., (2002). A survey on sensor networks. Communications Magazine, IEEE, 40(8), 102–114.
4. Ankerst, M., Breunig, M. M., Kriegel, H.-P., & Sander, J., (1999). OPTICS: Ordering points to identify the clustering structure. In ACM Sigmod Record (Special Interest Group on Management of Data), 49–60: Association for Computing Machinery (ACM).
5. Arel, I., Rose, D. C., & Karnowski, T. P., (2010). Deep machine learning–A new frontier in artificial intelligence research. Computational Intelligence Magazine, IEEE, 5(4), 13–18.
6. Arifovic, J., (1994). Genetic algorithm learning and the cobweb model. Journal of Economic Dynamics and Control, 18(1), 3–28.
7. Baak, A., Muller, M., Bharaj, G., Seidel, H. P., & Theobalt, C., (2011). A data-driven approach for real-time full body pose reconstruction from a depth camera. In Proceedings of the IEEE International Conference on Computer Vision, 1092–99. Barcelona.
8. Banerjee, A., Bandyopadhyay, T., & Acharya, P., (2014). Data analytics: Hyped up aspirations or true potential? Vikalpa: The Journal for Decision Makers, 38(4), 1–11.
9. Bate, A., Lindquist, M., Edwards, I., Olsson, S., Orre, R., Lansner, A., & De Freitas, R. M., (1998). A Bayesian neural network method for adverse drug reaction signal generation. European Journal of Clinical Pharmacology, 54(4), 315–321.
10. Bay, S., Kumaraswamy, K., Anderle, M. G., Kumar, R., & Steier, D. M., (2006). Large scale detection of irregularities in accounting data. In ICDM ’06: Proceedings of the Sixth International Conference on Data Mining, 75–86. Washington, DC, USA: IEEE Computer Society.
11. Bellman, R., (1956). Dynamic programming and Lagrange multipliers. Proceedings of the National Academy of Sciences of the United States of America, 42(10), 767.
12. Bertsekas, D. P., (1999). Nonlinear programming. Belmont, MA: Athena Scientific.
13. Berson, A., & Smith, S. J., (1997). Data warehousing, data mining, and OLAP. McGraw-Hill series on data warehousing and data management, New York: McGraw-Hill.
14. Bezdek, J. C., Ehrlich, R., & Full, W., (1984). FCM: The fuzzy c-means clustering algorithm. Computers & Geosciences, 10(2), 191–203.
15. Blei, D. M., Ng, A. Y., & Jordan, M. I., (2003). Latent dirichlet allocation. The Journal of Machine Learning Research, 3, 993–1022.
16. Breiman, L., Friedman, H., Olshen, R. A., & Stone, C. J., (1984). Classification and regression trees. The Wadsworth Statistics/Probability Series. Belmont, CA: Wadsworth International Group.
17. Breuniq, M. M., Kriegel, H. P., Sander, J., & Ng, R. T., (2000). LOF: Identifying density-based local outliers. In ACM Sigmod Record (Special Interest Group on Management of Data), 93–104: Association for Computing Machinery (ACM).
18. Brin, S., Motwani, R., & Silverstein, C., (1997). Beyond market baskets: Generalizing association rules to correlations. In ACM Sigmod Record (Special Interest Group on Management of Data), 265–76: Association for Computing Machinery (ACM).
19. Broomhead, D. S., & Lowe, D., (1988). Radial basis functions, multi-variable functional interpolation and adaptive networks. London: DTIC Document.
20. Bryson, A. E., (1975). Applied optimal control: Optimization, estimation and control. Washington DC: Hemisphere Publishing Corporation.
21. Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G., (2005). Learning to rank using gradient descent. In ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning, 89–96: Association for Computing Machinery (ACM).
22. Carme, J., & Jiménez, F. J. R., (2011). Open source solutions for big data management. Bezons, France: AtoS.
23. Cattell, R., (2011). Scalable SQL and NoSQL data stores. ACM Sigmod Record (Special Interest Group on Management of Data), 39(4), 12–27.
24. Celeux, G., & Govaert, G., (1992). A classification EM algorithm for clustering and two stochastic versions. Computational Statistics & Data Analysis, 14(3), 315–332.
25. Chae, B., & Olson, D. L., (2013). Business analytics for supply chain: A dynamic-capabilities framework. International Journal of Information Technology & Decision Making, 12(1), 9–26.
26. Chase, J. C. W., (2014). Innovations in business forecasting: Predictive analytics. Journal of Business Forecasting, 33(2), 26–32.
27. Chau, M., & Xu, J., (2012). Business intelligence in blogs: Understanding consumer interactions and communities. MIS Quarterly, 36(4), 1189–1216.
28. Cokins, G., (2014). Mining the past to see the future. Strategic Finance, 96(11), 23–30.
29. Condie, T., Conway, N., Alvaro, P., Hellerstein, J. M., Elmeleegy, K., & Sears, R., (2010). MapReduce online. In Proceedings of the 7th USENIX conference on Networked systems design and implementation, 21–21. San Jose, California: USENIX Association.
30. Crane, R. G., & Hewitson, B. C., (2003). Clustering and upscaling of station precipitation records to regional patterns using self-organizing maps (SOMs). Climate Research, 25(2), 95–107.
31. Cui, Y., Zhang, B., & Rao, G., (2014). A new iterative modularity-based method for graph clustering on scalable networks. Applied Mechanics & Materials, 644–650, 2562.
32. Dantzig, G. B., (1998). Linear programming and extensions. Princeton, NJ: Princeton University Press.
33. Dean, J., & Ghemawat, S., (2008). MapReduce: Simplified data processing on large clusters. Communications of the Association for Computing Machinery (ACM), 51(1), 107–113.
34. Dorigo, M., & Birattari, M., (2010). Ant colony optimization. In Encyclopedia of machine learning (pp. 36–39). New York, NY, USA: Springer.
35. Downing, C. E., (2010). Is web-based supply chain integration right for your company? Communications of the Association for Computing Machinery (ACM), 53(5), 134–137.
36. Duan, L., Xu, L., Guo, F., Lee, J., & Yan, B., (2007). A local-density based spatial clustering algorithm with noise. Information Systems, 32(7), 978–986.
37. Duan, L., Street, W. N., Liu, Y., Xu, S., & Wu, B., (2014). Selecting the right correlation measure for binary data. ACM Transactions on Knowledge Discovery from Data, 9(2), 13:1.
38. Duan, L., & Street, W. N., (2009). Finding maximal fully-correlated itemsets in large databases. In Proceedings - IEEE International Conference on Data Mining, ICDM, 770–75.
39. Duan, L., Street, W. N., & Liu, Y., (2013). Speeding up correlation search for binary data. Pattern Recognition Letters, 34(13), 1499–1507.
40. Duchowski, A. T., (2002). A breadth-first survey of eye-tracking applications. Behavior Research Methods, Instruments, & Computers, 34(4), 455–470.
41. Dunning, T., (1993). Accurate methods for the statistics of surprise and coincidence. Computational Linguistics, 19(1), 61–74.
42. Ester, M., Kriegel, H.-P., Sander, J., & Xu, X., (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), ed. E., Simoudis, J., Han, & U. M., Fayyad, 226–31. Portland: AAAI Press.
43. Fahad, A., Alshatri, N., Tari, Z., Alamri, A., Zomaya, A. Y., Khalil, I., … Bouras, A., (2014). A survey of clustering algorithms for big data: Taxonomy & empirical analysis. Emerging Topics in Computing, IEEE Transactions on 2, no 3: 267–79.
44. Fang, W., Pan, W., & Cui, Z., (2012). View of MapReduce: Programming model, methods, and its applications. IETE Technical Review, 29(5), 380–387.
45. Fayyad, U., & Uthurusamy, R., (2002). Evolving data into mining solutions for insights. Communications of the Association for Computing Machinery (ACM), 45(8), 28–31.
46. Geng, L., & Hamilton, H. J., (2006). Interestingness measures for data mining: A survey. ACM Computing Surveys (CSUR), 38(3), 9.
47. Gennari, J. H., Langley, P., & Fisher, D., (1989). Models of incremental concept formation. Artificial Intelligence, 40(1), 11–61.
48. Giudici, P., (2005). Applied data mining: statistical methods for business and industry. England: John Wiley & Sons.
49. Glover, F., & Laguna, M., (1999). Tabu search. Boston: Kluwer Academic Publishers.
50. Goldberg, D. E., (2006). Genetic algorithms in search, optimization and machine learning. Singapore: Pearson Education India.
51. Guha, S., Rastogi, R., & Shim, K., (1998). CURE: An efficient clustering algorithm for large databases. In ACM Sigmod Record (Special Interest Group on Management of Data), 73–84: Association for Computing Machinery (ACM).
52. Guha, S., Rastogi, R., & Shim, K., (2000). ROCK: A robust clustering algorithm for categorical attributes. Information Systems, 25(5), 345–366.
53. Hadley, G., & Hadley, G., (1962). Linear programming. vol. 4. Reading, MA: Addison–Wesley.
54. Han, J., Pei, J., & Yin, Y., (2000). Mining frequent patterns without candidate generation. In ACM Sigmod Record (Special Interest Group on Management of Data), 1–12: Association for Computing Machinery (ACM).
55. Hausman, J., & McFadden, D., (1984). Specification tests for the multinomial logit model. Econometrica 52, no 5: 1219–1240. Journal of the Econometric Society.
56. He, Q., Li, Z., & Zhang, X., (2010). Data deduplication techniques. In 2010 International Conference on Future Information Technology and Management Engineering, FITME 2010, 430–33. Changzhou IEEE.
57. Hinneburg, A., & Gabriel, H.-H., (2007). Denclue 2.0: Fast clustering based on kernel density estimation. In Proceedings of the Seventh International Symposium on Intelligent Data Analysis, ed. Berthold, MR, Shawe-Taylor, J., Lavrac, N., 70–80. Ljubljana, Slovenia: Springer.
58. Hinneburg, A., & Keim, D. A., (1999). Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In Proceedings of the 25th International Conference on Very Large Data Bases, ed. Tkinson, MP, Orlowska, M. E., Valduriez, P., Zdonik, S. B., Brodie, M. L., 506–17. Morgan Kaufmann, Edinburgh, UK.
59. Hosmer Jr, D. W., & Lemeshow, S., (2004). Applied logistic regression. New York: John Wiley & Sons.
60. Hu, D., Zhao, J. L., Hua, Z., & Wong, M. C. (2012). Network-based modeling and analysis of systemic risk in banking systems. MIS Quarterly, 36(4), 1269–1291.
61. Huang, Z., (1998). Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery, 2(3), 283–304.
62. Huang, Z., & Ng, M. K., (1999). A fuzzy k-modes algorithm for clustering categorical data. IEEE Transactions on Fuzzy Systems, 7(4), 446–452.
63. Jansen, B., Temmermans, F., & Deklerck, R., (2007). 3D human pose recognition for home monitoring of elderly. In 29th Annual International Conference of the IEEE Engineering in Medicine and Biology, 4049–51: IEEE.
64. Jensen, F. V., (1996). An introduction to Bayesian networks. Vol. 210. London, UK: UCL Press.
65. Kali, P., & Wallace, S. W., (1994). Stochastic programming. New York: John Wiley & Sons.
66. Kaplan, A. M., & Haenlein, M., (2010). Users of the world, unite! The challenges and opportunities of social media. Business Horizons, 53(1), 59–68.
67. Kaplan, E., & Hegarty, C., (2005). Understanding GPS: Principles and applications. Norwood, MA: Artech House.
68. Karypis, G., Han, E.-H., & Kumar, V., (1999). Chameleon: Hierarchical clustering using dynamic modeling. Computer, 32(8), 68–75.
69. Kennedy, J., (2010). Particle swarm optimization. In Encyclopedia of machine learning (pp. 760–766). US: Springer.
70. Kerber, R., (1992). Chimerge: Discretization of numeric attributes. In Proceedings of the tenth national conference on artificial intelligence, 123–28. San Jose, CA: AAAI Press.
71. Kirkos, E., Spathis, C., & Manolopoulos, Y., (2007). Data mining techniques for the detection of fraudulent financial statements. Expert Systems with Applications, 32(4), 995–1003.
72. Klee, V., & Minty, G. J., (1970). How good is the simplex algorithm. ed. Shisha, O, 159–79. New York: Inequalities Ill, Academic Press.
73. Kutner, M. H., Nachtsheim, C., & Neter, J., (2004). Applied linear regression models. Boston; New York: McGraw–Hill/Irwin.
74. Langville, A. N., & Meyer, C. D., (2011). Google's PageRank and beyond: The science of search engine rankings. Princeton, NJ: Princeton University Press.
75. Lau, R. Y., Liao, S. S., Wong, K.-F., & Chiu, D. K. (2012). Web 2.0 environmental scanning and adaptive decision support for business mergers and acquisitions. MIS Quarterly, 36(4), 1239–1268.
76. Lavalle, S., Lesser, E., Shockley, R., Hopkins, M. S., & Kruschwitz, N., (2013). Big data, analytics and the path from insights to value. MIT Sloan Management Review, 52, no 2: 21–32.
77. Lee, J., Jin, A., & Park, Y., (2011). Next-generation smartphones technology trend analysis. In KIPS Conference vol. 18(1).
78. MacQueen, J., (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, ed. Neyman, LMLCJ, 281–97. Oakland, CA, USA: University of California Press.
79. Madden, S., (2012). From databases to big data. IEEE Internet Computing, 16(3), 4–6.
80. McCreary, D., & Kelly, A., (2103). Making sense of NoSQL. Greenwich, CT: Manning Publications.
81. Merelli, I., Pérez-Sánchez, H., Gesing, S., & D'agostino, D., (2014). Managing, analysing, and integrating big data in medical bioinformatics: Open problems and future perspectives. BioMed Research International 2014: 1–13.
82. Metropolis, N., (1986). Massively parallel processing. Journal of Scientific Computing, 1(2), 115–116.
83. Moreta, S., & Telea, A., (2007). Multiscale visualization of dynamic software logs. In Proceedings of the 9th Joint Eurographics - IEEE VGTC Symposium on Visualization (EuroVis 2007). ed. K., Museth, KM, T., Möller, T., Möller, A., Ynnerman & A., Ynnerman, 11–18. Norrköping, Sweden: Aire-la-Ville: Eurographics Association.
84. Moscato, P., Cotta, C., & Mendes, A., (2004). Memetic algorithms. In New optimization techniques in engineering, ed. Onwubolu, G. C., Babu, B. V., 53–85: Springer-Verlag, Berlin Heidelberg.
85. Murty, K. G., (1976). Linear and combinatorial programming. Vol. 7. New York: Wiley.
86. Ng, R. T., & Han, J., (1994). Efficient and effective clustering methods for spatial data mining. In Proceedings of the 20th International Conference on Very Large Data Bases, 144–55: Morgan Kaufmann Publishers Inc.
87. Ng, R. T., & Han, J., (2002). Clarans: A method for clustering objects for spatial data mining. IEEE Transactions on Knowledge and Data Engineering, 14(5), 1003–1016.
88. Ngai, E. W. T., Hu, Y., Wong, Y. H., Chen, Y., & Sun, X., (2011). The application of data mining techniques in financial fraud detection: A classification framework and an academic review of literature. Decision Support Systems, 50(3), 559–569.
89. Park, S.-H., Huh, S.-Y., Oh, W., & Han, S. P., (2012). A social network-based inference model for validating customer profile data. MIS Quarterly, 36(4), 1217–1237.
90. Pearl, J., (2000). Causality: models, reasoning and inference. vol. 29. Cambridge, U.K.: Cambridge University Press.
91. Potra, F. A., & Wright, S. J., (2000). Interior-point methods. Journal of Computational and Applied Mathematics, 124(1), 281–302.
92. Quinlan, J. R., (1986). Induction of decision trees. Machine Learning, 1(1), 81–106.
93. Quinlan, J. R., (1992). Learning with continuous classes. In 5th Australian joint conference on artificial intelligence (AI 1992), 343–348: Singapore.
94. Quinlan, J. R., (1993). C4.5: Programs for machine learning. San Mateo: Morgan Kaufmann Publishers.
95. Quinn, M. J., (1994). Parallel computing: Theory and practice. vol. 8. New York: McGraw–Hill.
96. Rabiner, L., (1989). A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2), 257–286.
97. Ramos, J., (2003). Using tf-idf to determine word relevance in document queries. In Proceedings of the first instructional conference on machine learning (ICML). Piscataway, NJ.
98. Ravisankar, P., Ravi, V., Raghava Rao, G., & Bose, I. (2011). Detection of financial statement fraud and feature selection using data mining techniques. Decision Support Systems, 50(2), 491–500.
99. Roberts, C. M., (2006). Radio frequency identification (RFID). Computers & Security, 25(1), 18–26.
100. Robertson, S. E., Walker, S., Jones, S., Hancock-Beaulieu, M. M., & Gatford, M. (1995). Okapi at TREC-3. In Proceedings of the Third Text REtrieval Conference(TREC-3), NIST Special Publication 500-225, 109–26. Washington D.C.
101. Taskar, B., Guestrin, C., & Koller, D. (2004). Max-margin Markov networks. In Advances in neural information processing systems (NIPS 16), ed. S, Thrun, LSaBS, 25–32: MIT Press, Cambridge, MA.
102. Rosett, R. N., & Nelson, F. D., (1975). Estimation of the two-limit probit regression model. Econometrica: Journal of the Econometric Society, 43, no 1: 141–146.
103. Russom, P., (2011). Big data analytics. Renton, WA: The Data Warehousing Institute (TDWI) Best Practices Report.
104. Russom, P., (2013). Managing big data. Renton, WA: The Data Warehousing Institute (TDWI) Best Practices Report.
105. Said, S. E., & Dickey, D. A., (1984). Testing for unit roots in autoregressive-moving average models of unknown order. Biometrika, 71(3), 599–607.
106. Sagiroglu, S., & Sinanc, D., (2013). Big data: A review. In Proceedings of the International Conference on Collaboration Technologies and Systems (CTS '13), 42–47. San Diego, Calif, USA: The Institute of Electrical and Electronics Engineers (IEEE).
107. Schneider, R. D., (2012). Hadoop For Dummies®, Special Edition. Canada: John Wiley & Sons.
108. Schrader, R., (1981). Ellipsoid methods, ed. Korte, B, 265–311. North-Holland, Amsterdam: Modern Applied Mathematics - Optimization and Operations Research.
109. Seng, J.-L., & Chen, T. C., (2010). An analytic approach to select data mining for business decision. Expert Systems with Applications, 37(12), 8042–8057.
110. Shanno, D. F., (1970). Conditioning of quasi-Newton methods for function minimization. Mathematics of Computation, 24(111), 647–656.
111. Sheikholeslami, G., Chatterjee, S., & Zhang, A., (1998). Wavecluster: A multi-resolution clustering approach for very large spatial databases. In Proceedings of the 24th International Conference on Very Large Data Bases, 428–39. New York City, New York: Morgan Kaufmann Publishers Inc.
112. Shunnar, J., & Raver, D., (2014). Big data executive overview. Ohio, USA: ITG Software Engineering.
113. Silva, L. A. B., Beroud, L., Costa, C., & Oliveira, J. L. (2014). Medical imaging archiving: A comparison between several NoSQL solutions. In 2014 IEEE-EMBS International Conference on Biomedical and Health Informatics, BHI 2014, 65–68. Valencia: IEEE Computer Society.
114. Stamper, D. A., & Case, T., (1994). Business data communications. fourth edition ed. Redwood City, CA: Benjamin/Cummings Publishing Co.
115. Stonebraker, M., Abadi, D., Dewitt, D. J., Madden, S., Paulson, E., Pavlo, A., & Rasin, A., (2010). MapReduce and parallel DBMSs: Friends or foes? Communications of the ACM, 53(1), 64–71.
116. Suykens, J. A., & Vandewalle, J., (1999). Least squares support vector machine classifiers. Neural Processing Letters, 9(3), 293–300.
117. Tan, P.-N., Kumar, V., & Srivastava, J., (2004). Selecting the right objective measure for association analysis. Information Systems, 29(4), 293–313.
118. Tew, C., Giraud-Carrier, C., Tanner, K., & Burton, S., (2014). Behavior-based clustering and analysis of interestingness measures for association rule mining. Data Mining and Knowledge Discovery, 28(4), 1004–1045.
119. Trkman, P., Mccormack, K., De Oliveira, M. P. V., & Ladeira, M.B., (2010). The impact of business analytics on supply chain performance. Decision Support Systems, 49(3), 318–327.
120. Tsamardinos, I., Brown, L. E., & Aliferis, C. F., (2006). The max–min hill-climbing Bayesian network structure learning algorithm. Machine Learning, 65(1), 31–78.
121. Udell, M., (2014). From insight to action. Marketing Insights, 26(6), 38–43.
122. Van Laarhoven, P. J., & Aarts, E. H., (1987). Simulated annealing. Netherlands: Springer.
123. Vapnik, V., (1963). Pattern recognition using generalized portrait method. Automation and Remote Control, 24, 774–780.
124. Vapnik, V. N., & Vapnik, V., (1998). Statistical learning theory. Vol. 1. New York: Wiley.
125. Wagner, M. S., (2013). Google glass: A preemptive look at privacy concerns. Journal on Telecommunications & High Technology Law, 11(2), 477–492.
126. Wallach, H. M., (2006). Topic modeling: Beyond bag-of-words. In Proceedings of the 23rd international conference on machine learning, 977–984: ACM (Association for Computing Machinery).
127. Waller, M. A., & Fawcett, S. E., (2013a). Click here for a data scientist: Big data, predictive analytics, and theory development in the era of a maker movement supply chain. Journal of Business Logistics, 34(4), 249–252.
128. Waller, M. A., & Fawcett, S. E., (2013b). Data science, predictive analytics, and big data: A revolution that will transform supply chain design and management. Journal of Business Logistics, 34(2), 77–84.
129. Wang, Q., Garrity, G. M., Tiedje, J. M., & Cole, J. R. (2007). Naïve Bayesian classifier for rapid assignment of rRNA sequences into the new bacterial taxonomy. Applied and Environmental Microbiology, 73(16), 5261–5267.
130. Wang, W., Yang, J., & Muntz, R., (1997). STING: A statistical information grid approach to spatial data mining. In Proceedings of the 23rd International Conference on Very Large Data Bases, 186–95: Morgan Kaufmann Publishers Inc.
131. Widder, D. V., (1945). What is the Laplace transform? American Mathematical Monthly, 52, no 8: 419–425.
132. Wolsey, L. A., (1998). Integer programming. vol. 42. New York: Wiley.
133. Xiong, H., Shekhar, S., Tan, P.-N., & Kumar, V. (2006). TAPER: A two-step approach for all-strong-pairs correlation query in large databases. IEEE Transactions on Knowledge and Data Engineering, 18(4), 493–508.
134. Xiong, H., Zhou, W., Brodie, M., & Ma, S. (2008). Top-k φ correlation computation. INFORMS Journal on Computing, 20(4), 539–552.
135. Yang, J., & Yang, J.-Y., (2003). Why can LDA be performed in PCA transformed space? Pattern Recognition, 36(2), 563–566.
136. Ye, Y., & Chiang, C.-C., (2006). A parallel apriori algorithm for frequent itemsets mining. In Proceedings of the Fourth International Conference on Software Engineering Research, Management and Applications, 87–94: The Institute of Electrical and Electronics Engineers (IEEE).
137. Yin, X., Goudriaan, J., Lantinga, E. A., Vos, J., & Spiertz, H. J., (2003). A flexible sigmoid function of determinate growth. Annals of Botany, 91(3), 361–371.
138. Yuryevich, J., & Wong, K. P., (1999). Evolutionary programming based optimal power flow algorithm. IEEE Transactions on Power Systems, 14(4), 1245–1250.
139. Zaki, M. J., (2000). Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390.
140. Zaki, M. J., Parthasarathy, S., Ogihara, M., & Li, W., (1997). New algorithms for fast discovery of association rules. In 3rd International Conference on Knowledge Discovery and Data Mining (KDD), 283–86.
141. Zhang, T., Ramakrishnan, R., & Livny, M., (1996). BIRCH: An efficient data clustering method for very large databases. In ACM Sigmod Record (Special Interest Group on Management of Data), 103–14. Montreal, Canada: Association for Computing Machinery (ACM).
142. Zhou, Z.-H., Chawla, N. V., Jin, Y., & Williams, G. J., (2014). Big data opportunities and challenges: Discussions from data analytics perspectives. IEEE Computational Intelligence Magazine, 9(4), 62.