Articoli correlati a 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 - Brossura
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Pairwise Nearest Neighbor Clustering Method Revisited:...
Immagini fornite dal venditore
Pairwise Nearest Neighbor Clustering Method Revisited
Editore:
LAP LAMBERT Academic Publishing Jan 2010, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783838339184
Compra nuovo
EUR 49,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Pairwise Nearest Neighbor Clustering Method Revisited : Speed-up methods, Best clustering results in respect of the minimization of intra cluster variance, Optimal clustering
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783838339184
Compra nuovo
EUR 54,71
Spedizione EUR 35,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Pairwise Nearest Neighbor Clustering Method Revisited
Editore:
LAP Lambert Academic Publishing, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Nuovo
Brossura
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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 . Codice articolo 5414447
Compra nuovo
EUR 41,05
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Pairwise Nearest Neighbor Clustering Method Revisited
Editore:
LAP LAMBERT Academic Publishing Jan 2010, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783838339184
Compra nuovo
EUR 49,00
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Pairwise Nearest Neighbor Clustering Method Revisited | Speed-up methods, Best clustering results in respect of the minimization of intra cluster variance, Optimal clustering
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838339185
ISBN 13: 9783838339184
Nuovo
Taschenbuch
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 101221367
Compra nuovo
EUR 43,65
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili