Sciweavers

2227 search results - page 309 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
15 years 10 months 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
JCST
2008
121views more  JCST 2008»
15 years 6 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
CIKM
2008
Springer
15 years 8 months ago
Classifying networked entities with modularity kernels
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
Dell Zhang, Robert Mao
NIPS
2003
15 years 7 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
CAV
2009
Springer
165views Hardware» more  CAV 2009»
15 years 10 months ago
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
Sven Verdoolaege, Gerda Janssens, Maurice Bruynoog...