Sciweavers

1314 search results - page 107 / 263
» Approximate data mining in very large relational data
Sort
View
CIBCB
2005
IEEE
15 years 7 months ago
Feature Selection for Microarray Data Using Least Squares SVM and Particle Swarm Optimization
Feature selection is an important preprocessing technique for many pattern recognition problems. When the number of features is very large while the number of samples is relatively...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
107
Voted
ESANN
2004
15 years 3 months ago
Convergence properties of a fuzzy ARTMAP network
FAMR (Fuzzy ARTMAP with Relevance factor) is a FAM (Fuzzy ARTMAP) neural network used for classification, probability estimation [3], [2], and function approximation [4]. FAMR uses...
Razvan Andonie, Lucian Sasu
INFOCOM
2006
IEEE
15 years 7 months ago
Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...
Abhishek Kumar, Jun Xu
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
15 years 8 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street
PAKDD
2009
ACM
157views Data Mining» more  PAKDD 2009»
15 years 6 months ago
Analysis of Variational Bayesian Matrix Factorization
Abstract. Recently, the variational Bayesian approximation was applied to probabilistic matrix factorization and shown to perform very well in experiments. However, its good perfor...
Shinichi Nakajima, Masashi Sugiyama