. "\u010Cesk\u00E9 vysok\u00E9 u\u010Den\u00ED technick\u00E9 v Praze" . . "21230" . . "8"^^ . . . "RIV/68407700:21230/07:03132525!RIV08-AV0-21230___" . . "The visualization is an important technique used in many stages of data mining process. This article deals mostly with visualization for preprocessing purposes. The aim of our approach is to visualize distances (Euclidean or others) between data samples. This can be helpful when taking picture of data clustering. In classification tasks it can be used to select outlayer for removal. In this paper we present a novel way of such visualization which is based on a physical system simulation. It is inspired by intermolecular forces and employs overall energy minimization. This minimization is done via known unconstrained optimization numerical methods such as Steepest Descent, Conjugated Gradients or Quasi-Newton. The proposed algorithm was originally designed and was found useful when interpretting diversity in evolutionary algorithms. Here, we show its properties on well-known datasets Iris and Ecoli." . "Vizualizace dat zalo\u017Een\u00E1 na simulaci mezimolekul\u00E1rn\u00EDch sil"@cs . "\u0160norek, Miroslav" . . "Drchal, Jan" . . "3"^^ . . . "Dataset Visualization Based on a Simulation of Intermolecular Forces" . "data mining; optimization; visualization"@en . "415866" . "IWIM 2007 - International Workshop on Inductive Modelling" . "Dataset Visualization Based on a Simulation of Intermolecular Forces"@en . "Vizualiza\u010Dn\u00ED techniky jsou d\u016Fle\u017Eit\u00E9 v mnoha f\u00E1z\u00EDch dolov\u00E1n\u00ED dat. Tento \u010Dl\u00E1nek se zab\u00FDv\u00E1 p\u0159edev\u0161\u00EDm vizualizacemi pro p\u0159edzpracov\u00E1n\u00ED dat. \u00DA\u010Delem na\u0161eho p\u0159\u00EDstupu je vizualizace vzd\u00E1lenost\u00ED (euklidovsk\u00FDch i jin\u00FDch) mezi vzorky dat. Takov\u00E1to vizualizace umo\u017En\u00ED z\u00EDskat p\u0159ehled o shluc\u00EDch, rovn\u011B\u017E m\u016F\u017Ee slou\u017Eit jako vizu\u00E1ln\u00ED detekce ust\u0159elen\u00FDch vzork\u016F. V tomto \u010Dl\u00E1nku uv\u00E1d\u00EDme vizualiza\u010Dn\u00ED metodu kter\u00E1 je zalo\u017Eena na simulaci fyzik\u00E1ln\u00EDho syst\u00E9m, p\u0159esn\u011Bji na p\u016Fsoben\u00ED mezimolekul\u00E1rn\u00EDch sil a minimalizaci energie takov\u00E9ho syst\u00E9mu. Jsou porovn\u00E1ny r\u016Fzn\u00E9 optimaliza\u010Dn\u00ED algoritmy, jako: Gradientn\u00ED sestup, Konjugovan\u00E9 Gradienty i Quasi-Newtonovsk\u00E1 metoda. Algoritmus byl p\u016Fvodn\u011B navr\u017Een pro vizualizaci diverzity v evolu\u010Dn\u00EDch algoritmech, v tomto \u010Dl\u00E1nku uk\u00E1\u017Eeme jeho vlastnosti p\u0159i zobrazen\u00ED zn\u00E1m\u00FDch datab\u00E1z\u00ED Iris a E. coli."@cs . . "3"^^ . "[260BF964733B]" . "Dataset Visualization Based on a Simulation of Intermolecular Forces" . "978-80-01-03881-9" . "Dataset Visualization Based on a Simulation of Intermolecular Forces"@en . "246;253" . . . "Praha" . . "Praha" . . "Kord\u00EDk, Pavel" . "2007-09-23+02:00"^^ . . . . "The visualization is an important technique used in many stages of data mining process. This article deals mostly with visualization for preprocessing purposes. The aim of our approach is to visualize distances (Euclidean or others) between data samples. This can be helpful when taking picture of data clustering. In classification tasks it can be used to select outlayer for removal. In this paper we present a novel way of such visualization which is based on a physical system simulation. It is inspired by intermolecular forces and employs overall energy minimization. This minimization is done via known unconstrained optimization numerical methods such as Steepest Descent, Conjugated Gradients or Quasi-Newton. The proposed algorithm was originally designed and was found useful when interpretting diversity in evolutionary algorithms. Here, we show its properties on well-known datasets Iris and Ecoli."@en . "P(KJB201210701), Z(MSM6840770012)" . "RIV/68407700:21230/07:03132525" . . . "Vizualizace dat zalo\u017Een\u00E1 na simulaci mezimolekul\u00E1rn\u00EDch sil"@cs .