Sciweavers

2004 search results - page 211 / 401
» Sampling from large graphs
Sort
View
127
Voted
WWW
2010
ACM
15 years 10 months ago
Large-scale bot detection for search engines
In this paper, we propose a semi-supervised learning approach for classifying program (bot) generated web search traffic from that of genuine human users. The work is motivated by...
Hongwen Kang, Kuansan Wang, David Soukal, Fritz Be...
146
Voted
BMCBI
2010
113views more  BMCBI 2010»
15 years 3 months ago
Class prediction for high-dimensional class-imbalanced data
Background: The goal of class prediction studies is to develop rules to accurately predict the class membership of new samples. The rules are derived using the values of the varia...
Rok Blagus, Lara Lusa
BICOB
2009
Springer
15 years 1 months ago
A Biclustering Method to Discover Co-regulated Genes Using Diverse Gene Expression Datasets
We propose a two-step biclustering approach to mine co-regulation patterns of a given reference gene to discover other genes that function in a common biological process. Currently...
Doruk Bozdag, Jeffrey D. Parvin, Ümit V. &Cce...
137
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Exemplar-based Sparse Representation phone identification features
Exemplar-based techniques, such as k-nearest neighbors (kNNs) and Sparse Representations (SRs), can be used to model a test sample from a few training points in a dictionary set. ...
Tara N. Sainath, David Nahamoo, Bhuvana Ramabhadra...
DATAMINE
2006
89views more  DATAMINE 2006»
15 years 3 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh