Sciweavers

2763 search results - page 421 / 553
» The Dangerous 'All' in Specifications
Sort
View
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 6 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
KDD
2008
ACM
232views Data Mining» more  KDD 2008»
16 years 6 months ago
Anticipating annotations and emerging trends in biomedical literature
The BioJournalMonitor is a decision support system for the analysis of trends and topics in the biomedical literature. Its main goal is to identify potential diagnostic and therap...
Bernd Wachmann, Dmitriy Fradkin, Fabian Mörch...
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 6 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 6 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
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 6 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...