697 search results - page 7 / 140 » Approximation of Information Granule Sets |
190
click to vote
SDM
2011
SIAM
14 years 9 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
88
Voted
RSKT
2010
Springer
14 years 7 months ago
2010
Springer
Traditionally, membership to the fuzzy-rough lower, resp. upper approximation is determined by looking only at the worst, resp. best performing object. Consequently, when applied t...
IROS
2008
IEEE
15 years 3 months ago
2008
IEEE
— This paper presents an approach to approximate information content for active sensing tasks. The Unscented Transform is used to represent probability distributions by a set of ...
KDD
2012
ACM
12 years 12 months ago
2012
ACM
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...
ACM
1995
15 years 1 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...