Sciweavers

475 search results - page 37 / 95
» TSSP: A Reinforcement Algorithm to Find Related Papers
Sort
View
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
13 years 11 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
DAGSTUHL
2004
13 years 9 months ago
Personalization of Queries based on User Preferences
Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The und...
Georgia Koutrika, Yannis E. Ioannidis
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
DAWAK
2001
Springer
14 years 1 days ago
Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments
Multi-Dimensional Expressions (MDX) provide an interface for asking several related OLAP queries simultaneously. An interesting problem is how to optimize the execution of an MDX q...
Panos Kalnis, Dimitris Papadias
CEC
2008
IEEE
14 years 2 months ago
Distributed multi-relational data mining based on genetic algorithm
—An efficient algorithm for mining important association rule from multi-relational database using distributed mining ideas. Most existing data mining approaches look for rules i...
Wenxiang Dou, Jinglu Hu, Kotaro Hirasawa, Gengfeng...