Sciweavers

2932 search results - page 485 / 587
» Higher order mining
Sort
View
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
14 years 27 days ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 27 days ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
FLAIRS
2010
13 years 11 months ago
Using a Graph-Based Approach for Discovering Cybercrime
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
William Eberle, Lawrence B. Holder, Jeffrey Graves
AUSDM
2008
Springer
238views Data Mining» more  AUSDM 2008»
13 years 11 months ago
Graphics Hardware based Efficient and Scalable Fuzzy C-Means Clustering
The exceptional growth of graphics hardware in programmability and data processing speed in the past few years has fuelled extensive research in using it for general purpose compu...
S. A. Arul Shalom, Manoranjan Dash, Minh Tue
CIKM
2008
Springer
13 years 11 months ago
Viability of in-house datamarting approaches for population genetics analysis of snp genotypes
Background: Databases containing very large amounts of SNP (Single Nucleotide Polymorphism) data are now freely available for researchers interested in medical and/or population g...
Jorge Amigo, Christopher Phillips, Antonio Salas