• No results found

complex high-dimensional data

Hofner, Benjamin
  

(2011):


	Boosting in structured additive models.


Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik

Hofner, Benjamin (2011): Boosting in structured additive models. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik

... in complex, high-dimensional data sets that are hard to handle by using classical methods such as linear models with stepwise variable ...small data sets, and they can be used to derive ...

168

Dimension Reduction and Classification for High Dimensional Complex Data.

Dimension Reduction and Classification for High Dimensional Complex Data.

... (EEG) data set ...EEG data is a 256 by 64 random ...the High Dimension, Low Sample Size (HDLSS) data and the presence of the matrix-valued predictors pose signicant challenges to the ...

108

Classification Of High Dimensional Big Data In Distributed Computing Environment Using Fusion Based Learning

Classification Of High Dimensional Big Data In Distributed Computing Environment Using Fusion Based Learning

... Big data is large and complex unstructured data (images posted on Facebook, email, text messages, and GPS signals from mobile phones, tweets, and other updates on social media, ...Spatial ...

10

Supporter in High Dimensional Data Classification

Supporter in High Dimensional Data Classification

... assertively complex nonlinear issue into a course of action oflocally straight ones through neighbourhood learning, and after that learn incorporate relevance universally inside the broad edge ...a high ...

7

Modelling Interactions in High-dimensional Data with Backtracking

Modelling Interactions in High-dimensional Data with Backtracking

... Our Backtracking algorithm has been presented in the context of the Lasso for the linear model. However, the real power of the idea is that it can be incorporated into any method that produces a path of increasingly ...

31

Fast Data Collection for High Dimensional Data in Data Mining

Fast Data Collection for High Dimensional Data in Data Mining

... variables. For example a linear scaling of the input variables (that may be caused by a change of units for the measurements) is sufficient to modify the PCA results. Feature selection methods that are sufficient for ...

8

A new approach for data visualization problem

A new approach for data visualization problem

... 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 mapping is ...

10

Association of repeatedly measured intermediate risk factors for complex diseases with high dimensional SNP data

Association of repeatedly measured intermediate risk factors for complex diseases with high dimensional SNP data

... this data 3 individuals had a negative LDL cholesterol level and were therefore removed from the data, together with 27 individuals who had less than 2 observations for one or more of the 7 intermediate ...

13

Data Mining Resolution on High Dimensional Data

Data Mining Resolution on High Dimensional Data

... whole data representation and any reasoning process on the ...Big Data applications, where the key is to take the complex (nonlinear, many- to-many) data relationships, along with the evolving ...

7

Machine learning techniques for high dimensional data

Machine learning techniques for high dimensional data

... If the images contain enough distinctive objectives that can be easily detected (i.e. the information carried by image local structures is more significant than that carried by the image intensity values), the feature ...

213

RECURSIVE ANTIHUB2 OUTLIER DETECTION IN HIGH DIMENSIONAL DATA

RECURSIVE ANTIHUB2 OUTLIER DETECTION IN HIGH DIMENSIONAL DATA

... raw data collected from system. To identify unsupervised anomalies in high dimensional data is more ...in high dimensional data. Anomaly detection in high ...

6

Cluster based boosting for high dimensional data

Cluster based boosting for high dimensional data

... In this paper, we discussed and explained various boosting problem and proposed solutions and also described some clustering techniques. Boosting proved advantageous for more accurate results in machine learning. Cluster ...

5

Improving Efficiency In High Dimensional Data Sets

Improving Efficiency In High Dimensional Data Sets

... in high dimensional information with few perceptions are ending up more typical, particularly in microarray ...with high dimensional ...

6

Security Challenges Associated with High Dimensional Data

Security Challenges Associated with High Dimensional Data

... Big Data analytics by using tools such as Kerberos, secure shell (SSH), and internet protocol security (IPsec) to get a handle on real-time ...Big Data infrastructure, and what's called ...

7

Clustering of High-Dimensional Data Using Hubness

Clustering of High-Dimensional Data Using Hubness

... over high dimensional data becomes difficult due to empty space phenomenon and concentration of ...of high dimensional data representation presents distance between data ...

7

A Survey on High Dimensional Data Classification in Booster

A Survey on High Dimensional Data Classification in Booster

... unique instance of fluffy demonstrating, in which the yield of framework is fresh and discrete. Fluffy demonstrating furnishes high interpretability and permits working with uncertain information. To investigate ...

5

Clustering Algorithms for High Dimensional Data – A Survey

Clustering Algorithms for High Dimensional Data – A Survey

... exploratory data analysis which aims at summarizing main characteristics of ...in data sets and to identify a structure that might reside there, without having any specific background knowledge as ...

6

Eigenvalue regularized covariance matrix estimators for high dimensional data

Eigenvalue regularized covariance matrix estimators for high dimensional data

... the high-dimensional setting p/n → c > ...a data- splitting idea from Abadir et ...through data-splitting with theoretical justification of the split ...

175

Bayesian kernel projections for classification of high dimensional data

Bayesian kernel projections for classification of high dimensional data

... eigenvalues, thus it is possible to evaluate the expected utility for all candidate models. The BKPC algorithm thus proceeds as follows: for each random split, the algo- rithm carries out a spectral decomposition of the ...

24

High Performance Multidimensional Scaling for Large High Dimensional Data Visualization

High Performance Multidimensional Scaling for Large High Dimensional Data Visualization

... pubChem data, which is represented by a vector format, we also experimented on the proposed algorithm with other real data sets, which contains 30,000 biological se- quence data with respect to the ...

14

Show all 10000 documents...

Related subjects