An automatic graph layout procedure to visualize correlated data

IFIP International Federation for Information Processing

Volumn 217, Issue , 2006, Pages 179-188

  Inostroza Ponta, Mario ^a   Berretta, Regina ^a   Mendes, Alexandre ^a   Moscato, Pablo ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b Australian Government Australian Research Council   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROCEDURES; CORRELATED DATA; GRAPH PARTITION; HIER-ARCHICAL CLUSTERING; HIGHLY-CORRELATED; INDUSTRIAL SECTOR; QUADRATIC ASSIGNMENT PROBLEMS; SIMILARITY METRICS;

ARTIFICIAL INTELLIGENCE; COMMERCE; TIME SERIES;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 33845533162     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-34747-9_19     Document Type: Article

References (17)

1. V.V, Gafiychuk, B. Yo. Datsko, and J. Izmaylova. Analysis of data clusters obtained by self-organizing methods. Physica A: Statistical Mechanics and its Applications, 341:547-555, 2004.
2. N. Basalto, R. Bellotti, F. De Carlo, P. Facchi, and S. Pascazio. Clustering stock market companies via chaotic map synchronization. Physica A: Statistical Mechanics and its Applications, 345(1-2):196-206, 2005.
3. V. Boginski, S. Butenko, and P.M. Pardalos. On structural properties of the market graph. In A. Nagurney, editor. Innovations in Financial and Economic Networks, pages 28-45. Edward Elgar Publishing Inc, 2003.
4. S. Sahni and T. González. P-complete approximation problems. Journal of the Association for Computing Machinery, 23(3):555-565, 1976.
5. R. Burkard, E. Çela, P. Pardalos, and L. Pitsoulis. The quadratic assignment problem. In P. Pardalos and D. Du, editors. Handbook of Combinatorial Optimization, pages 241-338. Kluwer Academic Publishers, 1998.
6. E. Taillard. Robust taboo search for the quadratic assignment problem. Parallel Computing, 17(4-5):443-455, 1991.
7. C.A. Oliveira, P.M. Pardalos, and M.G.C. Resende. Grasp with path-relinking for the quadratic assignment problem. In C.C. Ribeiro and S.L. Martins, editors. Lecture Notes in Computer Science, volume 3059, pages 356-368. Springer-Verlag, 2004.
8. J. Carrizo, E.G. Tinetti, and P. Moscato. A computational ecology for the quadratic assignment problem. In Proceedings of the 21st Meeting on Informatics and Operations Research, Buenos Aires, Argentina, August, 1992.
9. P. Merz and B. Freisleben. A comparison of memetic algorithms, tabu search and ant colonies for the quadratic assigment problem. In Proceedings of the 1999 International Congress of Evolutionary Computation (CEC'99), Washington DC, USA, 6-9 July, 1999.
10. R. Berretta and P. Moscato. The number partitioning problem: An open challenge for evolutionary computation? In D. Corne and M. Dorigo, editors, New Ideas in Optimization, pages 261-278. McGraw-Hill, 1999.
11. L.S. Buriol, P.M. Franca, and P. Moscato. A new memetic algorithm for the asymmetric traveling salesman problem. Journal of Heuristics, 10(3);483-506, 2004.
12. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Norwell, Massachusetts, 1997.
13. M. Ausloos and K. Ivanova. Mechanistic approach to generalized technical analysis of share prices and stock market indices. The European Physical Journal B, 27:177-187, 2002.
14. J.M. González-Barrios and A.J. Quiroz. A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree. Statistics & Probability Letters, 62(l): 23-34, 2003.
15. P. Moscato, C. Cotta, and A. Mendes. Memetic algorithms. In G. Onwubolu and B. Babu, editors. New Optimization Techniques in Engineering, pages 53-86. Springer-Verlag, 2004.
16. P. Moscato. Memetic algorithms. In P. Pardalos and M. Resende, editors, Handbook of Applied Optimization. Oxford University Press, New York, NY, USA, 2002.
17. P. Moscato and C. Cotta. Memetic algorithms. In T.F. Gonzalez, editor. Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall/ CRC, 2006. to appear.