Verwandte Artikel zu Pairwise Nearest Neighbor Clustering Method Revisited:...
Pairwise Nearest Neighbor Clustering Method Revisited: Speed-up methods, Best clustering results in respect of the minimization of intra cluster variance, Optimal clustering - Softcover
Inhaltsangabe
Clustering is important problem that must be solved as a part of more complicated task in pattern recognition, image analysis and many other fields of science and engineering. The pairwise nearest neighbor method, also known as Ward's method belongs to the class of agglomerative clustering methods. The PNN method generates hierarchical clustering using a sequence of merge operations until the designed number of clusters is obtained. This method selects the cluster pair to be merged so that it increases the given objective function value least. We consider several speed-up methods for the PNN method, e.g., we utilize a k-neighborhood graph for reducing distance calculations. The PNN method can also be adapted for multilevel thresholding, which can be seen as a 1-dimensional special case of the clustering problem. The merge philosophy is also extended, by using the iterative shrinking method. In this way, we get better clustering results. The proposed method is also used as a crossover method in a genetic algorithm, which produces the best clustering results. The PNN algorithm can also be applied to generating optimal clustering.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
Olli M. Virmajoki, PhD: Studied Computer Science at University of Joensuu (University of Eastern Finland 2010-), Finland. It- engineering at Viatek inc., Espoo, Finland, It-designer at Finnmap inc., Helsinki, Finland, It-designer, City of Joensuu, Joensuu, Finland, Lecturer at Kajaani University of Applied Sciences, Kajaani, Finland.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für Pairwise Nearest Neighbor Clustering Method Revisited:...
Foto des Verkäufers
Pairwise Nearest Neighbor Clustering Method Revisited
Verlag:
LAP LAMBERT Academic Publishing Jan 2010, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Clustering is important problem that must be solved as a part of more complicated task in pattern recognition, image analysis and many other fields of science and engineering. The pairwise nearest neighbor method, also known as Ward's method belongs to the class of agglomerative clustering methods. The PNN method generates hierarchical clustering using a sequence of merge operations until the designed number of clusters is obtained. This method selects the cluster pair to be merged so that it increases the given objective function value least. We consider several speed-up methods for the PNN method, e.g., we utilize a k-neighborhood graph for reducing distance calculations. The PNN method can also be adapted for multilevel thresholding, which can be seen as a 1-dimensional special case of the clustering problem. The merge philosophy is also extended, by using the iterative shrinking method. In this way, we get better clustering results. The proposed method is also used as a crossover method in a genetic algorithm, which produces the best clustering results. The PNN algorithm can also be applied to generating optimal clustering. 68 pp. Englisch. Bestandsnummer des Verkäufers 9783838339184
Neu kaufen
EUR 49,00
EUR 23,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Pairwise Nearest Neighbor Clustering Method Revisited
Verlag:
LAP Lambert Academic Publishing, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Neu
Softcover
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Clustering is important problem that must be solved as a part of more complicated task in pattern recognition, image analysis and many other fields of science and engineering. The pairwise nearest neighbor method, also known as Ward s method belongs to the . Bestandsnummer des Verkäufers 5414447
Neu kaufen
EUR 41,05
EUR 48,99 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Pairwise Nearest Neighbor Clustering Method Revisited : Speed-up methods, Best clustering results in respect of the minimization of intra cluster variance, Optimal clustering
Verlag:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Clustering is important problem that must be solved as a part of more complicated task in pattern recognition, image analysis and many other fields of science and engineering. The pairwise nearest neighbor method, also known as Ward's method belongs to the class of agglomerative clustering methods. The PNN method generates hierarchical clustering using a sequence of merge operations until the designed number of clusters is obtained. This method selects the cluster pair to be merged so that it increases the given objective function value least. We consider several speed-up methods for the PNN method, e.g., we utilize a k-neighborhood graph for reducing distance calculations. The PNN method can also be adapted for multilevel thresholding, which can be seen as a 1-dimensional special case of the clustering problem. The merge philosophy is also extended, by using the iterative shrinking method. In this way, we get better clustering results. The proposed method is also used as a crossover method in a genetic algorithm, which produces the best clustering results. The PNN algorithm can also be applied to generating optimal clustering. Bestandsnummer des Verkäufers 9783838339184
Neu kaufen
EUR 70,99
EUR 30,50 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Pairwise Nearest Neighbor Clustering Method Revisited
Verlag:
LAP LAMBERT Academic Publishing Jan 2010, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Clustering is important problem that must be solved as a part of more complicated task in pattern recognition, image analysis and many other fields of science and engineering. The pairwise nearest neighbor method, also known as Ward''s method belongs to the class of agglomerative clustering methods. The PNN method generates hierarchical clustering using a sequence of merge operations until the designed number of clusters is obtained. This method selects the cluster pair to be merged so that it increases the given objective function value least. We consider several speed-up methods for the PNN method, e.g., we utilize a k-neighborhood graph for reducing distance calculations. The PNN method can also be adapted for multilevel thresholding, which can be seen as a 1-dimensional special case of the clustering problem. The merge philosophy is also extended, by using the iterative shrinking method. In this way, we get better clustering results. The proposed method is also used as a crossover method in a genetic algorithm, which produces the best clustering results. The PNN algorithm can also be applied to generating optimal clustering.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 68 pp. Englisch. Bestandsnummer des Verkäufers 9783838339184
Neu kaufen
EUR 49,00
EUR 60,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Pairwise Nearest Neighbor Clustering Method Revisited | Speed-up methods, Best clustering results in respect of the minimization of intra cluster variance, Optimal clustering
Verlag:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Neu
Taschenbuch
Anbieter: preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Pairwise Nearest Neighbor Clustering Method Revisited | Speed-up methods, Best clustering results in respect of the minimization of intra cluster variance, Optimal clustering | Olli Virmajoki | Taschenbuch | 68 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838339184 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Bestandsnummer des Verkäufers 101221367
Neu kaufen
EUR 43,40
EUR 70,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 5 verfügbar