Mining constraint relationships and redundancies with association analysis for optimization problem formulation

References

• Agrawal, Rakesh, Tomasz Imielinksi, and Arun Swami. 1993a. “Database Mining: A Performance Perspective.” IEEE Transactions on Knowledge and Data Engineering 5 (6): 914–925. doi:10.1109/69.250074
   Web of Science ®Google Scholar
• Agrawal, Rakesh, Tomasz Imielinski, and Arun Swami. 1993b. “Mining Association Rules between Sets of Items in Large Databases.” In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. New York, NY: ACM Press.
   Google Scholar
• Atluri, Gowtham, Rohit Gupta, Gang Fang, Gaurav Pandey, Michael Steinbach, and Vipin Kumar. 2009. “Association Analysis Techniques for Bioinformatics Problems.” Lecture Notes in Computer Science 5462 (0302): 1–13. doi:10.1007/978-3-642-00727-9_1
   Google Scholar
• Berbee, H. C. P., C. G. E. Boender, A. H. G. Rinnooy Ran, C. L. Scheffer, R. L. Smith, and Jan Telgen. 1987. “Hit-and-Run Algorithms for the Identification of Nonredundant Linear Inequalities.” Mathematical Programming 37 (1): 184–207. doi:10.1007/BF02591694
   Web of Science ®Google Scholar
• Boneh, Arnon. 1984. “Identification of Redundancy by a Set-Covering Equivalence.” In Operational Research” 84. Proceedings of the Tenth International Conference on Operational Research, edited by J. P. Brans, 407–422. Amsterdam: North Holland/Elsevier.
   Google Scholar
• Boot, T. C. G. 1962. “On Trivial and Binding Constraints in Programming Problems.” Management Science 8 (4): 419–441. doi: 10.1287/mnsc.8.4.419
   Web of Science ®Google Scholar
• Brearley, A. L., G. Mitra, and H. P. Williams. 1975. “Analysis of Mathematical Programming Problems Prior to Applying the Simplex Algorithm.” Mathematical Programming 8 (1): 54–83. http://www.jstor.org/stable/2627245 doi: 10.1007/BF01580428
   Web of Science ®Google Scholar
• Caron, R. J., J. F. McDonald, and C. M. Ponic. 1989. “A Degenerate Extreme Point Strategy for the Classification of Linear Constraints as Redundant or Necessary.” Journal of Optimization Theory and Applications 62 (2): 225–237. doi: 10.1007/BF00941055
   Web of Science ®Google Scholar
• Cheng, Hong, Philip Yu, and Jiawei Han. 2006. “AC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery.” In Proceedings of the Sixth International Conference on Data Mining (ICDM'06), 839–844. Hong Kong: IEEE.
   Google Scholar
• Feng, Jinghua. 1999. “Redundancy in Nonlinear Systems: A Set Covering Approach.” Masters Thesis. University of Windsor.
   Google Scholar
• Han, Jiawei, Jian Pei, Yiwen Yin, and Runying Mao. 2004. “Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach.” Data Mining and Knowledge Discovery 8 (1): 53–87. doi:10.1023/B:DAMI.0000005258.31418.83
   Web of Science ®Google Scholar
• Huang, Wenxue, Milorad Krneta, Limin Lin, Jianhong Wu, and Generation5 Math Technologies. 2006. “Association Bundle—A New Pattern for Association Analysis.” In Sixth IEEE International Conference on Data Mining- Workshops (ICDMW'06), 601–605. Hong Kong: IEEE.
   Google Scholar
• Karwan, Mark H., Vahid Lofti, Jan Telgen, and Stanley Zoints. 1983. Redundancy in Mathematical Programming: A State-of-the-Art Survey. New York: Springer.
   Google Scholar
• Lewis, Kemper, and Farrokh Mistree. 1996. “Foraging-Directed Adaptive Linear Programming: An Algorithm for Solving Nonlinear Mixed Discrete/continuous Design Problems.” In Proceedings of the 1996 ASME Design Engineering Technical Conferences and Computers in Engineering Conference, 1601. Irvine, CA.
   Google Scholar
• Özden, Banu, Sridhar Ramaswamy, and Avi Sillberschatz. 1998. “Cyclic Association Rules.” In 14th International Conference on Data Engineering, 1998 Proceedings, 412–421. Orlando, FL: IEEE.
   Google Scholar
• Pasquier, Nicolas, Yves Bastide, Rafik Taouil, and Lofti Lakhal. 1999. “Discovering Frequent Closed Itemsets for Association Rules.” In ICDT “99 Proceedings of the 7th International Conference on Database Theory, edited by Catriel Beeri and Peter Buneman, 398–416. Jerusalem, Israel: Springer.
   Google Scholar
• Paulraj, S., and P. Sumathi. 2010. “A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems.” Mathematical Problems in Engineering 2010 (723402): 1–16. doi:10.1155/2010/723402
   Web of Science ®Google Scholar
• Potter, C., S. Klooster, M. Steinbach, P. Tan, V. Kumar, S. Shekhar, R. Nemani, and R. Myneni. 2003. “Global Teleconnections of Ocean Climate to Terrestrial Carbon Flux.” Journal of Geophysical Research: Atmospheres 108 (D17): ACL 12-1–ACL 12-12. doi:10.1029/2002JD002979
   PubMed Web of Science ®Google Scholar
• Tan, Pang-Ning, Vipin Kumar, and Jaideep Srivastava. 2002. “Selecting the Right Interestingness Measure for Association Patterns.” In KDD” 02 Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 232–241. Edmonton, AB: ACM Press.
   Google Scholar
• Tan, Pang-Ning, Michael Steinbach, and Vipin Kumar. 2006. Introduction to Data Mining. Boston: Pearson Education.
   Google Scholar
• Thompson, Gerald L., Fred M. Tonge, and Stanley Zionts. 1966. “Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems.” Management Science 12 (7): 588–608. doi:10.1287/mnsc.12.7.588
   Google Scholar
• Wang, Liqun, Songqing Shan, and G. Gary Wang. 2004. “Mode-Pursuing Sampling Method for Global Optimization on Expensive Black-Box Functions.” Engineering Optimization 36 (4): 419–438. doi:10.1080/03052150410001686486
   Web of Science ®Google Scholar
• Wilde, Douglass. 1978. Globally Optimal Design. New York, NY: John Wiley and Sons.
   Google Scholar
• Xiong, Hui, Pang-Ning Tan, and Vipin Kumar. 2006. “Hyperclique Pattern Discovery.” Data Mining and Knowledge Discovery 13 (2): 219–242. doi:10.1007/s10618-006-0043-9
   Web of Science ®Google Scholar
• Zhou, Ling, and Stephen Yau. 2007. “Efficient Association Rule Mining among Both Frequent and Infrequent Items.” Computers & Mathematics with Applications 54 (6): 737–749. doi:10.1016/j.camwa.2007.02.010
   Web of Science ®Google Scholar