Sciweavers

1314 search results - page 48 / 263
» Approximate data mining in very large relational data
Sort
View
TNN
2010
176views Management» more  TNN 2010»
14 years 8 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
106
Voted
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 2 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
DAWAK
2004
Springer
15 years 7 months ago
Multidimensional Data Visual Exploration by Interactive Information Segments
Visualization techniques provide an outstanding role in KDD process for data analysis and mining. However, one image does not always convey successfully the inherent information fr...
Francisco J. Ferrer-Troyano, Jesús S. Aguil...
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
16 years 1 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
TIP
2008
113views more  TIP 2008»
15 years 1 months ago
Phase Local Approximation (PhaseLa) Technique for Phase Unwrap From Noisy Data
The local polynomial approximation (LPA) is a nonparametric regression technique with pointwise estimation in a sliding window. We apply the LPA of the argument of cos and sin in o...
Vladimir Katkovnik, Jaakko Astola, Karen O. Egiaza...