Sciweavers

241 search results - page 40 / 49
» Defining the Goals to Optimise Data Mining Performance
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 7 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
KDD
2004
ACM
141views Data Mining» more  KDD 2004»
14 years 8 months ago
A Maximum Entropy Approach to Biomedical Named Entity Recognition
Machine learning approaches are frequently used to solve name entity (NE) recognition (NER). In this paper we propose a hybrid method that uses maximum entropy (ME) as the underly...
Yi-Feng Lin, Tzong-Han Tsai, Wen-Chi Chou, Kuen-Pi...
FLAIRS
2004
13 years 9 months ago
The Optimality of Naive Bayes
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...
Harry Zhang
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 10 months ago
Factoring past exposure in display advertising targeting
Online advertising is increasingly becoming more performance oriented, where the decision to show an advertisement to a user is made based on the user’s propensity to respond to...
Neha Gupta, Abhimanyu Das, Sandeep Pandey, Vijay K...