Sciweavers

588 search results - page 61 / 118
» Discovering data quality rules
Sort
View
ICDE
2008
IEEE
155views Database» more  ICDE 2008»
14 years 9 months ago
Lattice Histograms: a Resilient Synopsis Structure
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
Panagiotis Karras, Nikos Mamoulis
ICASSP
2008
IEEE
14 years 2 months ago
3D facial expression recognition using swarm intelligence
In this paper, we present a novel approach for 3D facial expression recognition which is inspired by the advances of ant colony and particle swarm optimization (ACO and PSO respec...
Iordanis Mpiperis, Sotiris Malassiotis, Vassilios ...
AIR
2000
91views more  AIR 2000»
13 years 7 months ago
PlanMine: Predicting Plan Failures Using Sequence Mining
This paper presents the PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because p...
Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara
ICNC
2005
Springer
14 years 1 months ago
A Game-Theoretic Approach to Competitive Learning in Self-Organizing Maps
Abstract. Self-Organizing Maps (SOM) is a powerful tool for clustering and discovering patterns in data. Competitive learning in the SOM training process focusses on finding a neu...
Joseph P. Herbert, Jingtao Yao
SAT
2005
Springer
115views Hardware» more  SAT 2005»
14 years 1 months ago
Improved Exact Solvers for Weighted Max-SAT
We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ) which incorporate original data structures and inference rules, and a lower bound of better quality.
Teresa Alsinet, Felip Manyà, Jordi Planes