Incorporating Usage Information into Average-Clicks Algorithm.
Kalyan BeemanapalliRamya RangarajanJaideep SrivastavaPublished in: WEBKDD (2006)
Keyphrases
- times faster
- computational complexity
- experimental evaluation
- detection algorithm
- prior knowledge
- cost function
- improved algorithm
- final result
- probabilistic model
- convergence rate
- recognition algorithm
- clustering method
- optimization algorithm
- information sources
- high accuracy
- worst case
- domain knowledge
- k means
- gradient information
- dynamic programming
- input data
- np hard
- computationally efficient
- theoretical analysis
- significant improvement
- preprocessing
- optimal solution
- objective function
- information loss
- simulated annealing
- selection algorithm
- path planning
- information sharing
- tree structure
- expectation maximization
- learning algorithm
- end users
- computational cost
- similarity measure