Sciweavers

210 search results - page 6 / 42
» Fast Data Mining For Programming Support
Sort
View
ECML
2006
Springer
13 years 9 months ago
Efficient Large Scale Linear Programming Support Vector Machines
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
Suvrit Sra
HIS
2009
13 years 5 months ago
Ontology-Supported Web Recommender for Scholar Information
In this quickly developed and shifting era of Internet, how to make use of webpage indexing structure or search engines which let information demanders fast and precisely search a...
Sheng-Yuan Yang, Chun-Liang Hsu
KDD
2008
ACM
274views Data Mining» more  KDD 2008»
14 years 7 months ago
Data mining using high performance data clouds: experimental studies using sector and sphere
We describe the design and implementation of a high performance cloud that we have used to archive, analyze and mine large distributed data sets. By a cloud, we mean an infrastruc...
Robert L. Grossman, Yunhong Gu
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
13 years 11 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
13 years 11 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth