Sciweavers

227 search results - page 11 / 46
» Rough Set Methods in Approximation of Hierarchical Concepts
Sort
View
SIGIR
1999
ACM
13 years 12 months ago
Deriving Concept Hierarchies from Text
This paper presents a means of automatically deriving a hierarchical organization of concepts from a set of documents without use of training data or standard clustering technique...
Mark Sanderson, W. Bruce Croft
ECIR
2006
Springer
13 years 9 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
JUCS
2008
180views more  JUCS 2008»
13 years 7 months ago
A Novel Multi-Layer Level Set Method for Image Segmentation
: In this paper, a new multi-layer level set method is proposed for multi-phase image segmentation. The proposed method is based on the conception of image layer and improved numer...
Xiaofeng Wang, De-Shuang Huang
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
13 years 7 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
ATAL
2008
Springer
13 years 9 months ago
Stochastic search methods for nash equilibrium approximation in simulation-based games
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
Yevgeniy Vorobeychik, Michael P. Wellman