Sciweavers

1913 search results - page 305 / 383
» Using Data Mining in MURA Graphic Problems
Sort
View
SDM
2007
SIAM
98views Data Mining» more  SDM 2007»
15 years 1 months ago
Lattice based Clustering of Temporal Gene-Expression Matrices
Individuals show different cell classes when they are in the different stages of a disease, have different disease subtypes, or have different response to a treatment or envir...
Yang Huang, Martin Farach-Colton
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 11 days ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
16 years 7 days 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
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
15 years 3 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
15 years 12 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...