Sciweavers

697 search results - page 88 / 140
» Approximation of Information Granule Sets
Sort
View
ALT
2009
Springer
14 years 6 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 10 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
WWW
2009
ACM
14 years 10 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
JUCS
2010
176views more  JUCS 2010»
13 years 8 months ago
An Approach to Generation of Decision Rules
: Classical classification and clustering based on equivalence relations are very important tools in decision-making. An equivalence relation is usually determined by properties of...
Zhang Mingyi, Danning Li, Zhang Ying
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 11 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...