Sciweavers

1768 search results - page 202 / 354
» Mining Very Large Databases
Sort
View
115
Voted
DEXA
1995
Springer
96views Database» more  DEXA 1995»
15 years 7 months ago
Knowledge Organization for Exploration
To support applications, such as efficient browsing in large knowledge bases and cooperative knowledge discovery in large databases, the concept of rule similarity is essential. In...
Amihai Motro, Sylvie Goullioud
155
Voted
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 4 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
225
Voted
VLDB
2005
ACM
146views Database» more  VLDB 2005»
16 years 3 months ago
Adaptive website recommendations with AWESOME
Recommendations are crucial for the success of large websites. While there are many ways to determine recommendations, the relative quality of these recommenders depends on many fa...
Andreas Thor, Nick Golovin, Erhard Rahm
109
Voted
SAC
2005
ACM
15 years 9 months ago
Comparing approaches to predict transmembrane domains in protein sequences
There are today several systems for predicting transmembrane domains in membrane protein sequences. As they are based on different classifiers as well as different pre- and post-p...
Paul Davidsson, Johan Hagelbäck, Kenny Svenss...
250
Voted
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
16 years 5 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...