Sciweavers

664 search results - page 37 / 133
» Generalized Search Trees for Database Systems
Sort
View
SAC
2006
ACM
15 years 10 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
CIKM
2009
Springer
15 years 11 months ago
Maximal metric margin partitioning for similarity search indexes
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
SIGMOD
2010
ACM
204views Database» more  SIGMOD 2010»
15 years 2 months ago
Multi-dimensional keyword-based image annotation and search
Effective keyword search on image databases is a major open problem, due to the inherent imprecision of keywords (tags) used to describe images' content. In this paper we pre...
Ilaria Bartolini, Paolo Ciaccia
CIKM
2009
Springer
15 years 7 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 6 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh