Sciweavers

5866 search results - page 1117 / 1174
» An e-Process Selection Model
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 4 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
16 years 4 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 4 months ago
Detecting research topics via the correlation between graphs and texts
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
Yookyung Jo, Carl Lagoze, C. Lee Giles
KDD
2006
ACM
139views Data Mining» more  KDD 2006»
16 years 4 months ago
Generating semantic annotations for frequent patterns with context analysis
As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on ...
Qiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, Che...
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 4 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
« Prev « First page 1117 / 1174 Last » Next »