15351 search results - page 2812 / 3071 » The information bottleneck method |
160
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
144
Voted
CIKM
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
145
Voted
COLT
2005
Springer
15 years 5 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
178
Voted
DOLAP
2005
ACM
15 years 5 months ago
2005
ACM
Different modeling approaches have been proposed to overcome every design pitfall of the development of the different parts of a data warehouse (DW) system. However, they are all ...
147
Voted
DGCI
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Segmentation is an important step to obtain quantitative information from tomographic data sets. To this end, global thresholding is often used in practice. However, it i...