Sciweavers

253 search results - page 47 / 51
» Fast algorithms for time series mining
Sort
View
89
Voted
JCST
2008
121views more  JCST 2008»
14 years 10 months ago
Clustering Text Data Streams
Abstract Clustering text data streams is an important issue in data mining community and has a number of applications such as news group filtering, text crawling, document organiza...
Yubao Liu, Jiarong Cai, Jian Yin, Ada Wai-Chee Fu
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 7 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
15 years 4 months ago
Optimal Subsequence Bijection
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
Longin Jan Latecki, Qiang Wang, Suzan Koknar-Tezel...
TNN
2008
152views more  TNN 2008»
14 years 10 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
2001
ACM
145views Data Mining» more  KDD 2001»
15 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