Sciweavers

2635 search results - page 62 / 527
» Algorithms for the Database Layout Problem
Sort
View
124
Voted
DBPL
2007
Springer
103views Database» more  DBPL 2007»
15 years 6 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
128
Voted
ICML
2000
IEEE
16 years 3 months ago
Meta-Learning by Landmarking Various Learning Algorithms
Landmarking is a novel approach to describing tasks in meta-learning. Previous approaches to meta-learning mostly considered only statistics-inspired measures of the data as a sou...
Bernhard Pfahringer, Hilan Bensusan, Christophe G....
FIMI
2004
239views Data Mining» more  FIMI 2004»
15 years 4 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
165
Voted
IEAAIE
2009
Springer
15 years 9 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
133
Voted
VLDB
1997
ACM
142views Database» more  VLDB 1997»
15 years 6 months ago
Algorithms for Materialized View Design in Data Warehousing Environment
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
Jian Yang, Kamalakar Karlapalem, Qing Li