Sciweavers

1458 search results - page 167 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
TASLP
2008
124views more  TASLP 2008»
15 years 5 months ago
Semantic Annotation and Retrieval of Music and Sound Effects
We present a computer audition system that can both annotate novel audio tracks with semantically meaningful words and retrieve relevant tracks from a database of unlabeled audio c...
Douglas Turnbull, Luke Barrington, D. Torres, Gert...
IS
2007
15 years 5 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
ESCIENCE
2006
IEEE
15 years 9 months ago
ODIN: A Model for Adapting and Enriching Legacy Infrastructure
The Online Database of Interlinear Text (ODIN)1 is a database of interlinear text "snippets", harvested mostly from scholarly documents posted to the Web. Although large...
William D. Lewis
LWA
2007
15 years 7 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
KDD
2007
ACM
209views Data Mining» more  KDD 2007»
16 years 6 months ago
Temporal causal modeling with graphical granger methods
The need for mining causality, beyond mere statistical correlations, for real world problems has been recognized widely. Many of these applications naturally involve temporal data...
Andrew Arnold, Yan Liu, Naoki Abe