Sciweavers

387 search results - page 41 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 7 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
AIPS
2007
13 years 10 months ago
Angelic Semantics for High-Level Actions
High-level actions (HLAs) lie at the heart of hierarchical planning. Typically, an HLA admits multiple refinements into primitive action sequences. Correct descriptions of the ef...
Bhaskara Marthi, Stuart J. Russell, Jason Wolfe
IADIS
2008
13 years 9 months ago
Mining Postal Addresses
This paper presents FuMaS (Fuzzy Matching System), a system capable of an efficient retrieval of postal addresses from noisy queries. The fuzzy postal addresses retrieval has many...
José Carlos Cortizo, José Marí...
PKDD
2010
Springer
177views Data Mining» more  PKDD 2010»
13 years 6 months ago
ITCH: Information-Theoretic Cluster Hierarchies
Hierarchical clustering methods are widely used in various scientific domains such as molecular biology, medicine, economy, etc. Despite the maturity of the research field of hie...
Christian Böhm, Frank Fiedler, Annahita Oswal...
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
14 years 1 months ago
Adaptive Product Normalization: Using Online Learning for Record Linkage in Comparison Shopping
The problem of record linkage focuses on determining whether two object descriptions refer to the same underlying entity. Addressing this problem effectively has many practical ap...
Mikhail Bilenko, Sugato Basu, Mehran Sahami