Sciweavers

4085 search results - page 438 / 817
» Data Services - From Data to Containers
Sort
View
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 11 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
KDD
1997
ACM
146views Data Mining» more  KDD 1997»
15 years 11 months ago
Density-Connected Sets and their Application for Trend Detection in Spatial Databases
1 Several clustering algorithms have been proposed for class identification in spatial databases such as earth observation databases. The effectivity of the well-known algorithms ...
Martin Ester, Hans-Peter Kriegel, Jörg Sander...
DOCENG
2007
ACM
15 years 10 months ago
Speculative document evaluation
Optimisation of real world Variable Data printing (VDP) documents is a difficult problem because the interdependencies between layout functions may drastically reduce the number o...
Alexander J. Macdonald, David F. Brailsford, Steve...
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 8 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
BIS
2010
187views Business» more  BIS 2010»
15 years 8 months ago
Faceted Wikipedia Search
Wikipedia articles contain, besides free text, various types of structured information in the form of wiki markup. The type of wiki content that is most valuable for search are Wik...
Rasmus Hahn, Christian Bizer, Christopher Sahnwald...