128 search results - page 19 / 26 » On Mining Closed Sets in Multi-Relational Data |
KDD
2004
ACM
14 years 10 months ago
2004
ACM
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
ICDM
2009
IEEE
13 years 7 months ago
2009
IEEE
Our goal is to automatically identify which species of bird is present in an audio recording using supervised learning. Devising effective algorithms for bird species classificati...
KDD
2012
ACM
12 years 1 days ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
KDD
1999
ACM
14 years 1 months ago
1999
ACM
This paper investigates the use of supervised clustering in order to create sets of categories for classi cation of documents. We use information from a pre-existing taxonomy in o...