نتایج جستجو برای: rough extreme learning machine
تعداد نتایج: 842991 فیلتر نتایج به سال:
In this paper, a novel learning algorithm termed Hybrid Online Sequential Extreme Learning Machine (HOSELM) is proposed. The proposed HOS-ELM algorithm is a fusion of the Online Sequential Extreme Learning Machine (OS-ELM) and the Minimal Resource Allocation Network (MRAN). It is capable of reducing the number of hidden nodes in Single-hidden Layer Feed-forward Neural Networks (SLFNs) with Radi...
Extreme learning machine is a new scheme for learning the feedforward neural network, where the input weights and biases determining the nonlinear feature mapping are initiated randomly and are not learned. In this work we analyse approximation ability of the extreme learning machine depending on the activation function type and ranges from which input weights and biases are randomly generated....
Extreme Learning Machine (ELM) has salient features such as fast learning speed and excellent generalization performance. However, a single extreme learning machine is unstable in data classification. To overcome this drawback, more and more researchers consider using ensemble of ELMs. This paper proposes a method integrating voting-based extreme learning machines (V-ELM) with dissimilarity (D-...
In this article, we discuss methods based on the combination of rough sets and Boolean reasoning with applications in pattern recognition, machine learning, data mining and conflict analysis. 2006 Elsevier Inc. All rights reserved.
This paper proposes a method for creating a high quality collection of researchers’ homepages. The proposed method consists of three phases: rough filtering of the possible web pages, accurate evaluation of the web pages and precise selection of the correct homepages. For the rough filtering, the authors first define content-based keyword-lists, then generate filtering rules and relax the rules...
Database stores a huge amount of information in a structured and organized manner and provides many features for machine learning. There are a lot of algorithms to discover diierent kinds of rules from databases. In this paper, we propose a new method which can compute all maximal generalized rules in relational databases. The method integrates the machine learning paradigm, especially learning...
Multi-instance multi-label learning is a learning framework, where every object is represented by a bag of instances and associated with multiple labels simultaneously. The existing degeneration strategy-based methods often suffer from some common drawbacks: (1) the user-specific parameter for the number of clusters may incur the effective problem; (2) SVM may bring a high computational cost wh...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید