Forward Selection Component Analysis: Algorithms and Applications

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independent component analysis: algorithms and applications

A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons of computational and conceptual simplicity, the representation is often sought as a linear transformation of the original data. In other words, each component of the representation is a linear combination of the origi...

متن کامل

Sparse Principal Component Analysis: Algorithms and Applications

Sparse Principal Component Analysis: Algorithms and Applications

متن کامل

Blind Source Separation via Independent Component Analysis : Algorithms and Applications

Blind Source Separation (BSS) refers to the process of recovering source signals from a given mixture of unknown source signals were in no prior information about source and mixing methodology is known. Independent Component Analysis (ICA) is widely used BSS technique which allows separation of source components from complex mixture of signals based on certain statistical assumptions. This pape...

متن کامل

Forward Sequential Algorithms for Best Basis Selection∗

Recently, the problem of signal representation in terms of basis vectors from a large, ”overcomplete”, spanning dictionary has been the focus of much research. Achieving a succinct, or ”sparse”, representation is known as the problem of best basis representation. We consider methods which seek to solve this problem by sequentially building up a basis set for the signal. Three distinct algorithm...

متن کامل

Interval selection: Applications, algorithms, and lower bounds

Given a set of jobs, each consisting of a number of weighted intervals on the real line, and apositive integer m, we study the problem of selecting a maximum weight subset of the intervalssuch that at most one interval is selected from each job and, for any point p on the real line,at most m intervals containing p are selected. This problem has applications in molecularbiology, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence

سال: 2017

ISSN: 0162-8828,2160-9292

DOI: 10.1109/tpami.2017.2648792