Optimization and knowledge-based technologies

Informatica

Volumn 20, Issue 2, 2009, Pages 165-172

  Dzemyda, Gintautas ^a   Sakalauskas, Leonidas ^a  

^a VILNIUS UNIVERSITY   (Lithuania)

Author keywords

Data mining; Knowledge based technologies; Optimization; Statistical learning; Visualization

Indexed keywords

EID: 67651236892     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. Bartkutė-Norkūnienė, V. (2009). Stochastic optimization algorithms for support vector machines classification. Informatica, 20(2), 173-186.
2. Barzily, B., Z. Volkovich, B. Akteke-Öztürk, G.-W. Weber (2009). On a minimal spanning tree approach in the cluster validation problem. Informatica, 20(2), 187-202.
3. Belkin M., Niyogi P. (2003). Laplacian eigenmaps for dimensionality. Speech Communication, 1(2-3), 349-367.
4. Borg, I., P.J.F. Groenen (2005). Modern Multidimensional Scaling, 2nd ed. Springer Series in Statistics, Springer.
5. Cheng, R., et al. (1996). Measuring the influence of individual data points in a cluster analysis, Journal Classification, 13, 315-335.
6. Cortes, C., and V. Vapnik (1995). Support-vector networks. Machine Learning, 20(3), 273-297.
7. Cox, T.F., M.A.A. Cox (2001). Multidimensional Scaling, 2nd ed. Chapman and Hall/CRC.
8. Deng, J.L. (1988a). Introduction to grey system theory. The Journal of Grey Theory, 1, 1-24.
9. Dzemyda, G. (2001). Visualization of a set of parameters characterized by their correlation matrix. Computational Statistics and Data Analysis, 36(10), 15-30.
10. Dzemyda, G., O. Kurasova (2006). Heuristic approach for minimizing the projection error in the integrated mapping. European Journal of Operation Research, 171, 859-878.
11. Ermoliev, Yu.M. (1976). Methods of Stochastic Programming. Nauka, Moscow (in Russian).
12. Fagundez F., A. Xavier and J.L.D. Faco (2009). Continuous nonlinear programming techniques to solve scheduling problems. Informatica, 20(2), 203-216.
13. Friedman, J., et al. (1979). Multivariate generalizations of the Wolfowitz and Smirnov two-sample tests, Annals of Statistics, 7, 697-717.
14. Gasimov R. (2002). Augmented Lagrangean duality and nondifferantiable optimization methods in nonconvex programming. Journal of Global Optimization, 24, 187-203.
15. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Kluwer Academic Publishers, Boston, MA.
16. Grigaitis, D., V. Bartkutė, L. Sakalauskas (2007). An optimization of system for automatic recognition of ischemic stroke areas in computed tomography images. Informatica, 18(4), 603-614.
17. Hand, D., H. Mannila and P. Smyth (2001). Principles of Data Mining. The MIT Press.
18. Hwang, C.L., and K. Yoon (1981). Multiple Attribute Decision Making - Methods and Application. Springer-Verlag, Berlin.
19. Jolliffe, I.T. (2002). Principal Component Analysis. Springer.
20. Judd, J.S. (1987). Complexity of connectionist learning with various node functions. COINS. Technical Report, No. 87-60. University of Massachusetts.
21. Karbauskaitė, R., and G. Dzemyda (2009). Topology preservation measures in the visualization of manifoldtype multidimensional data. Informatica, 20(2), 235-254.
22. Khachay, M., and M. Pobery (2009). On the complexity and approximability of committee polyhedral separability. Informatica, 20(2), 217-234.
23. Kohonen, T. (2001). Self-Organizing Maps, 3rd ed. Springer Series in Information Sciences, Vol. 30. Springer.
24. Lin, J.H., J.S. Vitter (1991). Complexity results on learning by neural nets. Machine Learning, 6, 211-230.
25. Mao, J., A.K. Jain (1995). Artificial neural networks for feature extraction and multivariate data projection. IEEE Trans. Neural Networks, 6, 296-317.
26. Masseroli, M., P. Cerveri, P.G. Pelicci, M. Alcalay (2003). GAAS: gene array analyzer software for management, analysis and visualization of gene expression data. Bioinformatics, 19(6), 774-775.
27. Medvedev, V., G. Dzemyda (2006). Optimization of the local search in the training for SAMANN neural network. Journal of Global Optimization, 35, 607-623.
28. Misevičius, A. and D. Rubliauskas (2009). Testing of hybrid genetic algorithms for structured quadratic assignment problems. Informatica, 20(2), 255-272.
29. Norkin, V., and M. Keyzer (2009). On stochastic optimization and statistical learning in reproducing kernel Hilbert spaces by SVM. Informatica, 20(2), 273-292.
30. Sakalauskas, L. (2006). Modelling and simulation of business systems. European Journal of Operational Research, 175(3), 1339-14330.
31. Saul, L.K, and S.T. Roweis (2003). Think globally, fit locally: unsupervised learning of low dimensional manifolds. J. Machine Learning Research, 4, 119-155.
32. Sipahioglu, A., and T. Sarac (2009). The performance of the modified subgradient algorithm on solving the 0-1 quadratic knapsack problem. Informatica, 20(2), 293-304.
33. Yang (2000). Convergence of the simulated annealing algorithm for continuous global optimization. Journal of Optimization Theory and Applications, 104(3), 691-716.
34. Vault (2006). Vault Employer Profile. Goldman Sachs. New York, Vault, Inc.
35. Zavadskas, E.K., A. Kaklauskas, Z. Turskis, J. Tamošaitienė (2009). Multi-attribute decision-making model by applying grey numbers. Informatica, 20(2), 305-320.