Sciweavers

513 search results - page 61 / 103
» Efficient search for association rules
Sort
View
DAWAK
1999
Springer
15 years 2 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
WEBI
2004
Springer
15 years 3 months ago
Adaptation and Personalization in Web-based Learning Support Systems
In order to achieve optimal efficiency in a learning process, individual learner needs his/her own personalized assistance. For a web-based open and dynamic learning environment, ...
Lisa Fan
JMLR
2008
159views more  JMLR 2008»
14 years 9 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
IWPEC
2010
Springer
14 years 7 months ago
Partial Kernelization for Rank Aggregation: Theory and Experiments
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
Nadja Betzler, Robert Bredereck, Rolf Niedermeier
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
14 years 11 months ago
A fast algorithm to compute the controllability, decentralized fixed-mode, and minimum-phase radius of LTI systems
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
Simon Lam, Edward J. Davison