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

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

2017
Sinan Sameer Mahmood Al-Dabbagh Mustafa Abdul Sahib Naser Nawaf Hazim Barnouti

The string matching problem is considered as one of the most interesting research areas in the computer science field because it can be applied in many essential different applications such as intrusion detection, search analysis, editors, internet search engines, information retrieval and computational biology. During the matching process two main factors are used to evaluate the performance o...

2011
Seunghyun Im Zbigniew W. Ras Li-Shiang Tsay

An action is defined as controlling or changing some of attribute values in an information system to achieve desired result. An action reduct is the minimal set of attribute values distinguishing a favorable object from other objects. We use action reducts to formulate necessary actions. The action suggested by an action reduct induces changes of decision attribute values by changing the condit...

Journal: :International Journal of Computer Applications 2015

2010
Nandita Sengupta Jaya Sil

This paper briefly describes Information Detection System management by reducing dimension of the information system(IS) for network traffic both row wise and column wise. For dimension reduction, Rough Set Theory (RST) is used where determination of reduct and core plays a major role. But finding reduct is difficult task for a huge IS. Our paper suggests a technique where we propose to divide ...

2008
Shuchita Upadhyaya Rajni Jain

Clustering algorithms gives general description of the clusters listing number of clusters and member entities in those clusters. It lacks in generating cluster description in the form of pattern. Deriving pattern from clusters along with grouping of data into clusters is important from data mining perspective. In the proposed approach reduct from rough set theory is employed to generate patter...

Journal: :International Journal of Signal Processing, Image Processing and Pattern Recognition 2014

Journal: :IJAC 2012
Peter Mayr

Given tuples a1, . . . , ak and b in A n for some algebraic structure A, the subpower membership problem asks whether b is in the subalgebra of An that is generated by a1, . . . , ak . For A a finite group, there is a folklore algorithm which decides this problem in time polynomial in n and k. We show that the subpower membership problem for any finite Mal’cev algebra is in NP and give a polyno...

2015
Jiang Rong Tao Qin Bo An

Sponsored search auctions (SSAs) have attracted much research attention in recent years and different equilibrium concepts have been studied to understand advertisers’ behaviors. However, the assumption that bidders are perfectly rational in these studies is unrealistic in the real world. In this work, we investigate the quantal response equilibrium (QRE) for SSAs. QRE is powerful in characteri...

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

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