high-dimensional input data
A Survey on High Dimensional Data Classification in Booster
... There are two ideas in Booster to mirror the two spaces. The first is the shape, Booster'sequivalent of a customary array[6] a limited arrangement of components of a specific information compose, open through files. Not ...
5
Security Challenges Associated with High Dimensional Data
... of data. A popular example is the MapReduce framework, which splits an input file into multiple ...the data, performs some computation, and outputs a list of key/value ...large data sets are ...
7
New approaches for clustering high dimensional data
... as input, the co-clustering algorithm maximizes an objective function of the mutual information between row and column ...the data matrix into three components: row-coefficient matrix, column-coefficient ...
164
Surrogate modelling for the prediction of spatial fields based on simultaneous dimensionality reduction of high dimensional input/output spaces
... on data sampled at a set of locations in an ...the input fields is that the dimension of the stochastic input space is as high as the number of grid points in the computational ...
17
A new approach for data visualization problem
... between input data in the original high dimensional space and the output data in the projected ...original data and their corresponding inter point distances, but Sammon’s ...
10
Improving Efficiency In High Dimensional Data Sets
... as input, and performs its operations on ...redundant data, then the feature are checked with the already existing features and fulfills the ...redundant data otherwise the application will enter the ...
6
Booster in High Dimensional Data Classification
... There are two concepts in Booster to reflect the two domains. The first is the shape, Booster’sequivalent of a traditional array[6] a finite set of elements of a certain data-type, accessible through indices. ...
7
Fast Data Collection for High Dimensional Data in Data Mining
... Minimum Spanning tree of the input page. Second, we group nodes with an identical tag path into one equivalence class, and we select those equivalence classes which have exactly k members as our candidate classes. ...
8
RECURSIVE ANTIHUB2 OUTLIER DETECTION IN HIGH DIMENSIONAL DATA
... the data set with the sum of the distances from its k nearest ...the input points using some clustering algorithm and computes lower and upper bounds on the distance of a point from the kth nearest neighbor ...
6
Clustering Algorithms for High Dimensional Data – A Survey
... clustering high dimensional data is to overcome the “curse of ...clustering high dimensional ...of data or even for all high dimensional ...large data sets, ...
6
Cluster based boosting for high dimensional data
... Classifiers in the data mining can be divided by their learning process or representation of extracted knowledge. support vector machine (SVM), decision trees like ID3, C4.5, k-nearest neighbor classifiers, and ...
5
Modelling Interactions in High-dimensional Data with Backtracking
... with high-dimensional data, as they can produce stable, interpretable ...moderate-dimensional data, will prove to be a fruitful direction for future ...
31
MVS Clustering of Sparse and High Dimensional Data
... A calculation with sufficient execution and convenience in the majority of provision situations could be best to unified with better execution in a few cases however constrained use because of high multifaceted ...
5
High Performance Multidimensional Scaling for Large High Dimensional Data Visualization
... large data set even if the required memory is available in a single ...large data with efficiency, we have developed a parallel version of the MDS by using a Message Passing Interface (MPI) ...decompose ...
14
HIGH DIMENSIONAL DATA COMPUTATION USING ZINC EXPERIMENTS
... This paper presents a novel skyline algorithm SSPL on big data. SSPL utilizes sorted positional index lists which require low space overhead to reduce I/O cost significantly. We present a new indexing method ...
10
Bayesian kernel projections for classification of high dimensional data
... The data set is made up of images that are a sub- set of the Corel database, which contains 59,795 images of a wide variety of scenes, 8,114 of which are of ani- ...
24
Stochastic reconstruction of filament paths in fibre bundles based on two dimensional input data
... The data used in this work were acquired from Mansfield’s publication [27]. A small section of carbon fibre reinforced composite of approximately 100 µm x 140 µm, cut perpendicular to the nominal fibre path ...
31
Design and Implementation of Sensitive Information Security Model based on Term Clustering
... If such low dimensional data is provided very high security, no doubt with the increased complexity of the system, the system is able to send the high dimensional and delicate informatio[r] ...
6
Geographic information systems/national elevation data route mileage verification
... elevation data and are based on the X/Y-coordinates of the three-dimensional points on the planar plate [Rasdorf, et ...elevation data are in the format of gridded cells, the elevation of a specific ...
19
Three-dimensional data input using Sutherland's two-dimensional tablet strategies plus enhanced user feedback
... may is of they the to points, use by it of mat object or triangular can replaced the directly, the position vertices of user three-dimensional bypassing is the leaving earlier monitor Th[r] ...
268