Sciweavers

1403 search results - page 100 / 281
» Set cover algorithms for very large datasets
Sort
View
SDM
2004
SIAM
163views Data Mining» more  SDM 2004»
15 years 5 months ago
Basic Association Rules
Previous approaches for mining association rules generate large sets of association rules. Such sets are difficult for users to understand and manage. Here, the concept of a restri...
Guichong Li, Howard J. Hamilton
GFKL
2007
Springer
196views Data Mining» more  GFKL 2007»
15 years 10 months ago
Comparison of Recommender System Algorithms Focusing on the New-item and User-bias Problem
Recommender systems are used by an increasing number of e-commerce websites to help the customers to find suitable products from a large database. One of the most popular techniqu...
Stefan Hauger, Karen H. L. Tso, Lars Schmidt-Thiem...
117
Voted
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 4 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
BIBM
2010
IEEE
139views Bioinformatics» more  BIBM 2010»
15 years 1 months ago
Scalable, updatable predictive models for sequence data
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
Neeraj Koul, Ngot Bui, Vasant Honavar
ICFCA
2009
Springer
15 years 11 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...