Sciweavers

9209 search results - page 152 / 1842
» Data Space Randomization
Sort
View
JCIT
2010
190views more  JCIT 2010»
14 years 11 months ago
Application of Feature Extraction Method in Customer Churn Prediction Based on Random Forest and Transduction
With the development of telecom business, customer churn prediction becomes more and more important. An outstanding issue in customer churn prediction is high dimensional problem....
Yihui Qiu, Hong Li
AIED
2009
Springer
15 years 11 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
SIGIR
2008
ACM
15 years 4 months ago
Modeling expert finding as an absorbing random walk
We introduce a novel approach to expert finding based on multi-step relevance propagation from documents to related candidates. Relevance propagation is modeled with an absorbing ...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
IADIS
2003
15 years 6 months ago
Optimizing Web Server's Data Transfer with Hotlinks
We study the optimization of the expected number of bytes that must be transferred by the Web server when a user visits one of its pages. Given a Web site, we want to find an assi...
Evangelos Kranakis, Danny Krizanc, Miguel Vargas M...
153
Voted
AAAI
2008
15 years 7 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang