Sciweavers

4604 search results - page 308 / 921
» Correlation-based Data Representation
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
16 years 5 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
SEMWEB
2009
Springer
15 years 11 months ago
TripleRank: Ranking Semantic Web Data by Tensor Decomposition
Abstract. The Semantic Web fosters novel applications targeting a more efficient and satisfying exploitation of the data available on the web, e.g. faceted browsing of linked open...
Thomas Franz, Antje Schultz, Sergej Sizov, Steffen...
CVPR
2007
IEEE
15 years 11 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao
IPPS
2007
IEEE
15 years 11 months ago
Nonuniformly Communicating Noncontiguous Data: A Case Study with PETSc and MPI
Due to the complexity associated with developing parallel applications, scientists and engineers rely on highlevel software libraries such as PETSc, ScaLAPACK and PESSL to ease th...
Pavan Balaji, Darius Buntinas, Satish Balay, Barry...
156
Voted
GRAPHITE
2003
ACM
15 years 10 months ago
Smooth surface reconstruction from noisy range data
This paper shows that scattered range data can be smoothed at low cost by fitting a Radial Basis Function (RBF) to the data and convolving with a smoothing kernel (low pass filt...
Jonathan C. Carr, Richard K. Beatson, Bruce C. McC...