[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Igarashi, 2005 - Google Patents

Visualization of optimal solutions using self-organizing maps in computational electromagnetism

Igarashi, 2005

Document ID
10481283346323823756
Author
Igarashi H
Publication year
Publication venue
IEEE transactions on magnetics

External Links

Snippet

In this paper, the self-organizing map is applied for visualization and clustering of optimal solutions in parameter spaces. The present method is tested for the simplified version of De Jong's function and TEAM workshop problem 22. It is shown that the present method …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
    • G06K9/6251—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on a criterion of topology preservation, e.g. multidimensional scaling, self-organising maps
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6261—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation partitioning the feature space
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
    • G06K9/6247—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on an approximation criterion, e.g. principal component analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6267—Classification techniques
    • G06K9/6268—Classification techniques relating to the classification paradigm, e.g. parametric or non-parametric approaches
    • G06K9/6269—Classification techniques relating to the classification paradigm, e.g. parametric or non-parametric approaches based on the distance between the decision surface and training patterns lying on the boundary of the class cluster, e.g. support vector machines
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6267—Classification techniques
    • G06K9/6279—Classification techniques relating to the number of classes
    • G06K9/6284—Single class perspective, e.g. one-against-all classification; Novelty detection; Outlier detection
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
    • G01R33/00—Arrangements or instruments for measuring magnetic variables
    • G01R33/20—Arrangements or instruments for measuring magnetic variables involving magnetic resonance

Similar Documents

Publication Publication Date Title
Gahegan Is inductive machine learning just another wild goose (or might it lay the golden egg)?
CN111712842B (en) Refine qubit calibration model using supervised learning
Gong et al. Multiobjective sparse non-negative matrix factorization
Izbicki et al. High-dimensional density ratio estimation with extensions to approximate likelihood computation
Chattopadhyay et al. Comparison of visualization of optimal clustering using self-organizing map and growing hierarchical self-organizing map in cellular manufacturing system
Gupta et al. Integration of spectator qubits into quantum computer architectures for hardware tune-up and calibration
Sumedha et al. Unsupervised and semi-supervised clustering by message passing: soft-constraint affinity propagation
Allam Jr et al. Paying attention to astronomical transients: introducing the time-series transformer for photometric classification
Igarashi Visualization of optimal solutions using self-organizing maps in computational electromagnetism
Qi et al. Iterative gradient descent for outlier detection
Settouti et al. An instance and variable selection approach in pixel-based classification for automatic white blood cells segmentation
Kuleshov et al. High-dimensional density estimation for data mining tasks
Ozertem et al. Continuously differentiable sample-spacing entropy estimation
Yang et al. GMBLOF: A machine learning algorithm of novelty detection based on local outlier factor
Pao et al. Visualization of pattern data through learning of non-linear variance-conserving dimension-reduction mapping
Nagy Data-driven analysis of fractality and other characteristics of complex networks
Lin et al. Machine learning-based approach for automatic ion implanter monitoring
Tinós et al. Analyzing evolutionary algorithms for dynamic optimization problems based on the dynamical systems approach
Zhang et al. Color clustering using self-organizing maps
Mohebi et al. Modified self-organising maps with a new topology and initialisation algorithm
Kasatkin et al. ClassiFIM: an unsupervised method to detect phase transitions
Vijendra et al. An effective clustering algorithm for data mining
Shewchuk et al. Toward learning time-varying functions with high input dimensionality
Huang et al. Weighted lasso estimates for sparse logistic regression: non-asymptotic properties with measurement error
Lu et al. K‐Nearest Neighbor Intervals Based AP Clustering Algorithm for Large Incomplete Data