Sciweavers

1314 search results - page 73 / 263
» Approximate data mining in very large relational data
Sort
View
113
Voted
DAWAK
2008
Springer
15 years 3 months ago
Is a Voting Approach Accurate for Opinion Mining?
In this paper, we focus on classifying documents according to opinion and value judgment they contain. The main originality of our approach is to combine linguistic pre-processing,...
Michel Plantié, Mathieu Roche, Gérar...
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
16 years 1 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
13 years 4 months ago
The long and the short of it: summarising event sequences with serial episodes
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
Nikolaj Tatti, Jilles Vreeken
DEXAW
2007
IEEE
141views Database» more  DEXAW 2007»
15 years 8 months ago
SWARD: Semantic Web Abridged Relational Databases
The semantic web represents meta-data as a relation of triples using the RDF data model. We have developed a virtual repository system that enables to process queries to RDF views...
Johan Petrini, Tore Risch
KDD
1999
ACM
166views Data Mining» more  KDD 1999»
15 years 6 months ago
CACTUS - Clustering Categorical Data Using Summaries
Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Rece...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...