Sciweavers

492 search results - page 69 / 99
» The number of possibilities for random dating
Sort
View
NIPS
2001
13 years 10 months ago
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
Matthew Richardson, Pedro Domingos
UAI
2003
13 years 10 months ago
Exploiting Locality in Searching the Web
Published experiments on spidering the Web suggest that, given training data in the form of a (relatively small) subgraph of the Web containing a subset of a selected class of tar...
Joel Young, Thomas Dean
CORR
2006
Springer
148views Education» more  CORR 2006»
13 years 8 months ago
Budget Optimization in Search-Based Advertising Auctions
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
Jon Feldman, S. Muthukrishnan, Martin Pál, ...
JIFS
2008
155views more  JIFS 2008»
13 years 8 months ago
Improving supervised learning performance by using fuzzy clustering method to select training data
The crucial issue in many classification applications is how to achieve the best possible classifier with a limited number of labeled data for training. Training data selection is ...
Donghai Guan, Weiwei Yuan, Young-Koo Lee, Andrey G...
TEC
2008
146views more  TEC 2008»
13 years 8 months ago
An Evolutionary Algorithm Approach to Optimal Ensemble Classifiers for DNA Microarray Data Analysis
In general, the analysis of microarray data requires two steps: feature selection and classification. From a variety of feature selection methods and classifiers, it is difficult t...
Kyung-Joong Kim, Sung-Bae Cho