نتایج جستجو برای: quick reduct algorithm

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

J. Jin, J.N. He, L.J. Li,

A quick group search optimizer (QGSO) is an intelligent optimization algorithm which has been applied in structural optimal design, including the hinged spatial structural system. The accuracy and convergence rate of QGSO are feasible to deal with a spatial structural system. In this paper, the QGSO algorithm optimization is adopted in seismic research of steel frames with semi-rigid connection...

2016
Shrikant Brajesh Sagar Akhilesh Tiwari

The present paper proposes a new approach for the effective weighted association rule mining. The proposed approach utilizes the power of Rough Set Theory for obtaining reduct of the targeted dataset. Additionally, approach takes the benefit for weighted measures and the Genetic Algorithm for the generation of the desired set of rules. Enough analysis of proposed approach has been done and obse...

Journal: :TEM Journal 2023

The core challenge in the process of knowledge discovery is pre-processing data. Pre-processing data involves feature selection due to substantial amount and degree dimension attribute. concept attribute reduction introduced by Pawlak rough set theory for computational efficiency accuracy. This helps eliminate unnecessary attributes. Rough neutrosophic an extension traditional hybrid theory. pa...

2012
Renu Vashist M. L Garg

Data mining has emerged as most significant and continuously evolving field of research because of it‘s ever growing and far reaching applications into various areas such as medical, military, financial markets, banking etc. One of the most useful applications of data mining is extracting significant and earlier unknown knowledge from real-world databases. This knowledge may be in the form of r...

2000
Won-Chul BANG Zeungnam BIEN

s In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general descriptions of concepts from specific instances of these concepts. In many real life situations, however, new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of...

2016
GURAM BEZHANISHVILI Albert Visser

There are two standard model-theoretic methods for proving the finite model property for modal and superintuionistic logics, the standard filtration and the selective filtration. While the corresponding algebraic descriptions are better understood in modal logic, it is our aim to give similar algebraic descriptions of filtrations for superintuitionistic logics via locally finite reducts of Heyt...

2017
Nidhi Patel

Over the past two decades, Machine Learning has become one of the mainstays of information technology. Machine learning is concerned with the development of algorithms and achieves optimization classification of attributes. Classification under the decision tree is the prediction approach of data mining techniques. In the decision tree, classification algorithm has the most common classifier to...

2009
Yan WANG Lizhuang MA

Rough set approach has been recognized to be one of the powerful tools in medical feature selection. Many feature selection methods based on rough set have been proposed, where numerous experimental results have demonstrated that these methods based on discernibility matrix are efficient. However, the high storage space and the time-consuming computation restrict its application. In this paper,...

2017
Heinrich Jiang

Quick Shift is a popular mode-seeking and clustering algorithm. We present finite sample statistical consistency guarantees for Quick Shift on mode and cluster recovery under mild distributional assumptions. We then apply our results to construct a consistent modal regression algorithm.

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

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