Sciweavers

464 search results - page 15 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
GBRPR
2005
Springer
15 years 3 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
RSFDGRC
2005
Springer
111views Data Mining» more  RSFDGRC 2005»
15 years 2 months ago
Feature Selection with Adjustable Criteria
Abstract. We present a study on a rough set based approach for feature selection. Instead of using significance or support, Parameterized Average Support Heuristic (PASH) consider...
Jingtao Yao, Ming Zhang
IPMU
2010
Springer
15 years 1 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
ECIR
2006
Springer
14 years 10 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
JCIT
2007
107views more  JCIT 2007»
14 years 9 months ago
A New Approach to Computing Weighted Attributes Values in Incomplete Information Systems
The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the general...
Tian Hong, Wang Xiukun, Henryk Rybinski