Sciweavers

488 search results - page 15 / 98
» General Database Statistics Using Entropy Maximization
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 9 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
MM
2010
ACM
162views Multimedia» more  MM 2010»
13 years 9 months ago
Interactive visual object search through mutual information maximization
Searching for small objects (e.g., logos) in images is a critical yet challenging problem. It becomes more difficult when target objects differ significantly from the query object...
Jingjing Meng, Junsong Yuan, Yuning Jiang, Nitya N...
ECCV
2006
Springer
14 years 11 months ago
Unsupervised Texture Segmentation with Nonparametric Neighborhood Statistics
Abstract. This paper presents a novel approach to unsupervised texture segmentation that relies on a very general nonparametric statistical model of image neighborhoods. The method...
Suyash P. Awate, Tolga Tasdizen, Ross T. Whitaker
BMCBI
2010
126views more  BMCBI 2010»
13 years 9 months ago
A boosting method for maximizing the partial area under the ROC curve
Background: The receiver operating characteristic (ROC) curve is a fundamental tool to assess the discriminant performance for not only a single marker but also a score function c...
Osamu Komori, Shinto Eguchi
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...