Sciweavers

210 search results - page 12 / 42
» Fast Data Mining For Programming Support
Sort
View
FIMI
2004
123views Data Mining» more  FIMI 2004»
13 years 11 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon
EDM
2009
132views Data Mining» more  EDM 2009»
13 years 7 months ago
Predicting Students Drop Out: A Case Study
The monitoring and support of university freshmen is considered very important at many educational institutions. In this paper we describe the results of the educational data minin...
Gerben Dekker, Mykola Pechenizkiy, Jan Vleeshouwer...
TNN
2008
152views more  TNN 2008»
13 years 9 months ago
Distributed Parallel Support Vector Machines in Strongly Connected Networks
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 10 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
14 years 10 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian