Sciweavers

17688 search results - page 85 / 3538
» Data Set Balancing
Sort
View
SIAMSC
2008
159views more  SIAMSC 2008»
15 years 2 months ago
Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
Coding of data, usually upstream of data analysis, has crucial implications for the data analysis results. By modifying the data coding
Fionn Murtagh, Geoff Downs, Pedro Contreras
WSDM
2012
ACM
252views Data Mining» more  WSDM 2012»
13 years 10 months ago
WebSets: extracting sets of entities from the web using unsupervised information extraction
We describe a open-domain information extraction method for extracting concept-instance pairs from an HTML corpus. Most earlier approaches to this problem rely on combining cluste...
Bhavana Bharat Dalvi, William W. Cohen, Jamie Call...
ICIP
2004
IEEE
16 years 4 months ago
Rate-distortion analysis of random access for compressed light fields
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from the data set. Ef...
Prashant Ramanathan, Bernd Girod
ICA3PP
2005
Springer
15 years 8 months ago
Data Distribution Strategies for Domain Decomposition Applications in Grid Environments
Abstract. In this paper, we evaluate message-passing applications in Grid environments using domain decomposition technique. We compare two domain decomposition strategies: a balan...
Beatriz Otero, José M. Cela, Rosa M. Badia,...
ISMVL
2009
IEEE
161views Hardware» more  ISMVL 2009»
15 years 9 months ago
Mining Approximative Descriptions of Sets Using Rough Sets
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from data sets, a problem of intere...
Dan A. Simovici, Selim Mimaroglu