Sciweavers

1492 search results - page 75 / 299
» Geometric Clustering Using the Information Bottleneck Method
Sort
View
TASLP
2010
144views more  TASLP 2010»
14 years 11 months ago
Active Learning With Sampling by Uncertainty and Density for Data Annotations
To solve the knowledge bottleneck problem, active learning has been widely used for its ability to automatically select the most informative unlabeled examples for human annotation...
Jingbo Zhu, Huizhen Wang, Benjamin K. Tsou, Matthe...
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
16 years 4 months ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...
CVPR
2005
IEEE
15 years 6 months ago
Fast Illumination-Invariant Background Subtraction Using Two Views: Error Analysis, Sensor Placement and Applications
Background modeling and subtraction to detect new or moving objects in a scene is an important component of many intelligent video applications. Compared to a single camera, the u...
Ser-Nam Lim, Anurag Mittal, Larry S. Davis, Nikos ...
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
16 years 5 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
CASES
2003
ACM
15 years 9 months ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...