Sciweavers

214 search results - page 41 / 43
» New Parallel Algorithms for Frequent Itemset Mining in Very ...
Sort
View
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
13 years 10 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 2 days ago
A Scalable Collaborative Filtering Framework Based on Co-Clustering
Collaborative filtering-based recommender systems, which automatically predict preferred products of a user using known preferences of other users, have become extremely popular ...
Thomas George, Srujana Merugu
BMCBI
2010
132views more  BMCBI 2010»
13 years 6 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
13 years 10 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
ROCAI
2004
Springer
13 years 12 months ago
Learning Mixtures of Localized Rules by Maximizing the Area Under the ROC Curve
We introduce a model class for statistical learning which is based on mixtures of propositional rules. In our mixture model, the weight of a rule is not uniform over the entire ins...
Tobias Sing, Niko Beerenwinkel, Thomas Lengauer