Sciweavers

3280 search results - page 161 / 656
» MiTAP for real users, real data, real problems
Sort
View
AAAI
2010
15 years 8 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
SDM
2007
SIAM
167views Data Mining» more  SDM 2007»
15 years 7 months ago
Bandits for Taxonomies: A Model-based Approach
We consider a novel problem of learning an optimal matching, in an online fashion, between two feature spaces that are organized as taxonomies. We formulate this as a multi-armed ...
Sandeep Pandey, Deepak Agarwal, Deepayan Chakrabar...
IJRR
2008
151views more  IJRR 2008»
15 years 6 months ago
Trajectory Optimization using Reinforcement Learning for Map Exploration
Automatically building maps from sensor data is a necessary and fundamental skill for mobile robots; as a result, considerable research attention has focused on the technical chall...
Thomas Kollar, Nicholas Roy
KSEM
2010
Springer
15 years 4 months ago
Towards Scalable Instance Retrieval over Ontologies
In this paper, we consider the problem of query answering over large multimedia ontologies. Traditional reasoning systems may have problems to deal with large amounts of expressive...
Alissa Kaplunova, Ralf Möller, Sebastian Wand...
PKDD
2005
Springer
138views Data Mining» more  PKDD 2005»
15 years 12 months ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
Lionel Savary, Karine Zeitouni