نتایج جستجو برای: high dimensional data

تعداد نتایج: 4272118  

Journal: :Journal of Modern Applied Statistical Methods 2012

Journal: :Journal of Computational and Graphical Statistics 2020

Journal: :Computational Statistics 2022

Abstract The inverse square root of a covariance matrix is often desirable for performing data whitening in the process applying many common multivariate analysis methods. Direct calculation not available when either singular or nearly singular, as occurs high dimensions. We develop new methods, which we broadly call polynomial , to construct low-degree empirical has similar properties true (sh...

2017
Charles Bouveyron Stephane Girard Cordelia Schmid Stéphane Girard

We propose a new method of discriminant analysis, called High Dimensional Discriminant Analysis (HHDA). Our approach is based on the assumption that high dimensional data live in different subspaces with low dimensionality. Thus, HDDA reduces the dimension for each class independently and regularizes class conditional covariance matrices in order to adapt the Gaussian framework to high dimensio...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس 1389

growing demands and requires of high data rate systems cause significant increase of high frequency systems for wideband communication applications. as mixers are one of the main blocks of each receivers and its performance has great impact on receiver’s performance; in this thesis, a new solution for ku-band (12-18 ghz) mixer design in tsmc 0.18 µm is presented. this mixer has high linearity a...

Background and purpose: By evolving science, knowledge, and technology, we deal with high-dimensional data in which the number of predictors may considerably exceed the sample size. The main problems with high-dimensional data are the estimation of the coefficients and interpretation. For high-dimension problems, classical methods are not reliable because of a large number of predictor variable...

1998
Rakesh Agrawal Johannes Gehrke Dimitrios Gunopulos Prabhakar Raghavan

Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end-user comprehensibility of the results, non-presumption of any canonical data distribution, and insensitivity to the order of input records. We present CLIQUE, a clustering algorithm that satisses each of these require...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید