Sciweavers

2070 search results - page 144 / 414
» Regret-Minimizing Representative Databases
Sort
View
119
Voted
ICPR
2008
IEEE
16 years 4 months ago
Image retrieval with graph kernel on regions
In the framework of the interactive search in image databases, we are interested in similarity measures able to learn during the search and usable in real-time. Images are represe...
Justine Lebrun, Sylvie Philipp-Foliguet, Philippe ...
119
Voted
ICPR
2002
IEEE
16 years 4 months ago
Handwritten Character Recognition Based on Structural Characteristics
In this paper a handwritten character recognition algorithm based on structural characteristics, histograms and profiles, is presented. The well-known horizontal and vertical hist...
Ergina Kavallieratou, Nikos Fakotakis, George K. K...
119
Voted
WWW
2006
ACM
16 years 4 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
16 years 3 months ago
Discovering significant rules
In many applications, association rules will only be interesting if they represent non-trivial correlations between all constituent items. Numerous techniques have been developed ...
Geoffrey I. Webb
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 3 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici