Mining and Visualizing Recommendation Spaces for Elliptic PDEs with Continuous Attributes

ACM Transactions on Mathematical Software

Volumn 26, Issue 2, 2000, Pages 254-273

  Ramakrishnan, Naren ^a   Ribbens, Calvin J ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Associations; Data mining; Performance evaluation; Recommender systems

Indexed keywords

EID: 0002491405     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/353474.353481     Document Type: Article

References (37)

1. ADDISON, C., ENRIGHT, W., GAFFNEY, P., GLADWELL, I., AND HANSON, P. 1991. Algorithm 687: A Decision Tree for the Numerical Solution of Initial Value Ordinary Differential Equations. ACM Transactions on Mathematical Software Vol. 17, 1, pp. 1-10.
2. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. 1993. Mining Association Rules Between Sets of Items in Large Databases. Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 207-216. Washington, D.C.
3. AGRAWAL, R., MANNILA, H., SRIKANT, R., TOIVONEN, H., AND VERKAMO, A. I. 1996. Fast Discovery of Association Rules. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy Eds., Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, Cambridge, MA.
4. BAYARDO, R. J., JR. AND AGRAWAL, R. 1999. Mining the Most Interesting Rules. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
5. BENTLEY, J. L. 1986. Programming Pearls. Addison-Wesley.
6. BOISVERT, R., RICE, J., AND HOUSTIS, E. 1979. A System for Performance Evaluation of Partial Differential Equations Software. IEEE Transactions on Software Engineering Vol. SE-5, 4 (July), pp. 418-425.
7. DE STURLER, E. 1996. A Performance Model for Krylov Subspace Methods on Mesh-Based Parallel Computers. Parallel Computing 22, pp. 57-74.
8. FUKUDA, T., MORIMOTO, Y., MORISHITA, S., AND TOKUYAMA, T. 1996. Data Mining Using Two-Dimensional Optimized Association Rules: Schema, Algorithms and Visualization. Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 13-23.
9. GREENBAUM, A. 1997. Iterative Methods for Solving Linear Systems. SIAM, Philadelphia. HAN, J., LAKSHMANAN, L. V. S., AND NG, R. T. 1999. Constraint-Based, Multidimensional Data Mining. IEEE Computer 32, 8, pp. 46-50.
10. HELLERSTEIN, J. M., AVNUR, R., CHOU, A., HIDBER, C., OLSTON, C., RAMAN, V., ROTH, T., AND HAAS, P. J. 1999. Interactive Data Analysis: The Control Project. IEEE Computer 32, 8, pp. 51-59.
11. HIDBER, C. 1999. Online Association Rule Mining. Proceedings of the ACM SIGMOD Con-ference on Management of Data, pp. 145-156.
12. HOUSTIS, E., RICE, J., WEERAWARANA, S., CATLIN, A., PAPCHIOU, P., WANG, K., AND GATTATZES, M. 1998. Parallel ELLPACK: A Problem Solving Environment for PDE Based Applications on Multicomputer Platforms. ACM Transactions on Mathematical Software 24, 1, pp. 30-73.
13. HOUSTIS, E. N., CATLIN, A. C., RICE, J. R., VERYKIOS, V. S., RAMAKRISHNAN, N., AND HOUSTIS, C. E. 2000. PYTHIA II: A Knowledge/Database System for Managing Performance Data and Recommending Scientific Software. ACM Transactions on Mathematical Software. appears in this issue.
14. IMIELINSKI, T. AND MANNILA, H. 1996. A Database Perspective on Knowledge Discovery. Communications of the ACM, pp. 58-64.
15. KAMEL, M., MA, K., AND ENRIGHT, W. 1993. ODEXPERT: An Expert System to Select Numerical Solvers for Initial Value ODE Systems. ACM Transactions on Mathematical Software 19, pp. 44-62.
16. LUCKS, M. AND GLADWELL, I. 1992. Automated Selection of Mathematical Software. ACM Transactions on Mathematical Software Vol. 18, 1, pp. 11-34.
17. MANBER, U. 1992. Introduction to Algorithms: A Creative Approach. Addison-Wesley.
18. MITCHELL, T. M. 1982. Generalization as Search. Artificial Intelligence 18, 2, pp. 203-226.
19. NOWELL, L. T. 1997. Graphical Encoding for Information Visualization: Using Icon Color, Shape, and Size to Convey Nominal and Quantitative Data. Ph.D. thesis, Virginia Polytechnic Institute and State University.
20. PARK, J. S., CHEN, M.-S., AND PHILIP, S. Y. 1995. An Effective Hash Based Algorithm for Mining Association Rules. Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 175-186.
21. POMMERELL, C. AND FICHTNER, W. 1994. Memory Aspects and Performance of Iterative Solvers. SIAM J. Sci. Comput. 15, pp. 460-473.
22. RAMAKRISHNAN, N. 1999. Experiences with an Algorithm Recommender System. In P. Saudisch Ed., Proceedings of the CHI'99 Workshop on Recommender Systems. ACM SIGCHI Press.
23. RAMAKRISHNAN, N. AND GRAMA, A. 1999. Data Mining: From Serendipity to Science. IEEE Computer 32, 8, pp. 34-37. Guest Editors' Introduction to the Special Issue on Data Mining. RAMAKRISHNAN, N. AND VALDŚS-PÉREZ, R. E. 2000. Note on Generalization in Experimental Algorithmics. ACM Transactions on Mathematical Software, to appear.
24. RIBBENS, C. J. AND RICE, J. R. 1986. Realistic PDE Solutions for Non-Rectangular Domains. Technical Report CSD-TR-639, Department of Computer Sciences, Purdue University, West Lafayette, IN.
25. RICE, J. 1976. The Algorithm Selection Problem. Advances in Computers 15, pp. 65-118. Academic Press, New York.
26. RICE, J. 1984. Algorithm 625: A Two-Dimensional Domain Processor. ACM Transactions on Mathematical Software 10, pp. 453-462.
27. RICE, J., HOUSTIS, E., AND DYKSEN, W. 1981. A Population of Linear, Second Order, Elliptic Partial Differential Equations on Rectangular Domains, Part I. Mathematics of Computation 36, pp. 475-484.
28. RICE, J. R. AND BOISVERT, R. F. 1985. Solving Elliptic Problems Using ELLPACK. Springer-Verlag, New York.
29. SAAD, Y. 1990. SPARSKIT: A Basic Tool Kit for Sparse Matrix Computations. Technical Report 90-20, Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA.
30. SAAD, Y. 1996. Iterative Methods for Sparse Linear Systems. PWS Publishing, Boston.
31. SARAWAGI, S., THOMAS, S., AND AGRAWAL, R. 1998. Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications. Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 343-354.
32. SCHMID, W., PAFFRATH, M., AND HOPPE, R. H. W. 1995. Application of Iterative Methods for Solving Nonsymmetric Linear Systems in the Simulation of Semiconductor Processing. Surv. Math. Indust. 5, pp. 1-26.
33. SMALLMAN, H. S. AND BOYNTON, R. M. 1990. Segregation of Basic Colors in an Information Display. Journal of the Optical Society of America 7, 102, pp. 1985-1994.
34. STEINACHER, S. 1998. Data Mining: What Your Data Would Tell You if It Could Talk. http://news400.com.
35. SUBRAMANIAN, D. AND FEIGENBAUM, J. 1986. Factorization in Experiment Generation. Proceedings of the National Conference on Artificial Intelligence (AAAI'86), pp. 518-522.
36. WEERAWARANA, S., HOUSTIS, E., RICE, J., JOSHI, A., AND HOUSTIS, C. 1996. PYTHIA: A Knowledge Based System to Select Scientific Algorithms. ACM Transactions on Mathematical Software 22, pp. 447-468.
37. ZHANG, J. 1996. Preconditioned Krylov Subspace Methods for Solving Nonsymmetric Matrices from CFD Applications. Technical Report 280-98, Department of Computer Science, University of Kentucky, Lexington, KY. To appear in Computer Methods in Applied Mechanics and Engineering.