We present a supervised method for Learning in Parallel Universes, i.e. problems given in multiple descriptor spaces. The goal is the construction of local models in individual universes and their fusion to a superior global model that comprises all the available information from the given universes. We employ a predictive clustering approach using Neighborgrams, a one-dimensional data structure for the neighborhood of a single object in a universe. We also present an intuitive visualization, which allows for interactive model construction and visual comparison of cluster neighborhoods across universes
We describe an interactive way to generate a set of clusters for a given data set. The clustering is...
If the promise of computational modeling is to be fully realized in higher-level cognitive domains s...
This paper introduces an approach for clustering/classification which is based on the use of local, ...
Abstract. We present a supervised method for Learning in Parallel Universes, i.e. problems given in ...
We discuss Learning in parallel universes as a learning concept that encompasses the simultaneous an...
Most learning algorithms operate in a clearly defined feature space and assume that all relevant str...
universes as a learning concept that encompasses the simultaneous analysis from multiple descriptor ...
This abstract summarizes a brief, preliminary formalization of learning in parallel universes. It al...
Many clustering algorithms have been proposed in recent years. Most methods operate in an iterative ...
This work addresses two challenges in combination: learning with a very limited number of labeled tr...
We propose a modified fuzzy c-means algorithm that operates on different feature spaces, so-called p...
We present an extension of the fuzzy c-Means algorithm, which operates simultaneously on different f...
AbstractWe present an extension of the fuzzy c-Means algorithm, which operates simultaneously on dif...
We present an extension of the fuzzy c-Means algorithm that operates on different feature spaces, so...
Learning in parallel universes and the mining for local patterns are both relatively new fields of r...
We describe an interactive way to generate a set of clusters for a given data set. The clustering is...
If the promise of computational modeling is to be fully realized in higher-level cognitive domains s...
This paper introduces an approach for clustering/classification which is based on the use of local, ...
Abstract. We present a supervised method for Learning in Parallel Universes, i.e. problems given in ...
We discuss Learning in parallel universes as a learning concept that encompasses the simultaneous an...
Most learning algorithms operate in a clearly defined feature space and assume that all relevant str...
universes as a learning concept that encompasses the simultaneous analysis from multiple descriptor ...
This abstract summarizes a brief, preliminary formalization of learning in parallel universes. It al...
Many clustering algorithms have been proposed in recent years. Most methods operate in an iterative ...
This work addresses two challenges in combination: learning with a very limited number of labeled tr...
We propose a modified fuzzy c-means algorithm that operates on different feature spaces, so-called p...
We present an extension of the fuzzy c-Means algorithm, which operates simultaneously on different f...
AbstractWe present an extension of the fuzzy c-Means algorithm, which operates simultaneously on dif...
We present an extension of the fuzzy c-Means algorithm that operates on different feature spaces, so...
Learning in parallel universes and the mining for local patterns are both relatively new fields of r...
We describe an interactive way to generate a set of clusters for a given data set. The clustering is...
If the promise of computational modeling is to be fully realized in higher-level cognitive domains s...
This paper introduces an approach for clustering/classification which is based on the use of local, ...