Sciweavers

245 search results - page 33 / 49
» Efficient Algorithms for Discovering Association Rules
Sort
View
DKE
2002
218views more  DKE 2002»
14 years 11 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
SAC
2010
ACM
15 years 6 months ago
Mining temporal relationships among categories
Temporal text mining deals with discovering temporal patterns in text over a period of time. A Theme Evolution Graph (TEG) is used to visualize when new themes are created and how...
Saket S. R. Mengle, Nazli Goharian
EOR
2006
120views more  EOR 2006»
14 years 11 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
AUSAI
2005
Springer
15 years 5 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb
WWW
2006
ACM
16 years 11 days ago
Mining related queries from search engine query logs
In this work we propose a method that retrieves a list of related queries given an initial input query. The related queries are based on the query log of previously issued queries...
Xiaodong Shi, Christopher C. Yang