Sciweavers

732 search results - page 120 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
CIKM
2006
Springer
13 years 11 months ago
Classification spanning correlated data streams
In many applications, classifiers need to be built based on multiple related data streams. For example, stock streams and news streams are related, where the classification patter...
Yabo Xu, Ke Wang, Ada Wai-Chee Fu, Rong She, Jian ...
ICDE
2008
IEEE
110views Database» more  ICDE 2008»
14 years 9 months ago
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
Muhammed Miah, Gautam Das, Vagelis Hristidis, Heik...
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
14 years 7 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
DATESO
2010
286views Database» more  DATESO 2010»
13 years 5 months ago
Fast Fibonacci Encoding Algorithm
Abstract. Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups...
Jirí Walder, Michal Krátký, J...