Sciweavers

302 search results - page 52 / 61
» Efficient frequent pattern mining over data streams
Sort
View
WAIM
2004
Springer
15 years 3 months ago
Learning-Based Top-N Selection Query Evaluation over Relational Databases
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
Liang Zhu, Weiyi Meng
ICWE
2010
Springer
14 years 8 months ago
Association-Rules-Based Recommender System for Personalization in Adaptive Web-Based Applications
Personalization systems based upon users' surfing behavior analysis imply three phases: data collection, pattern discovery and recommendation. Due to the dimension of log file...
Daniel Mican, Nicolae Tomai
VLDB
1998
ACM
112views Database» more  VLDB 1998»
15 years 1 months ago
Incremental Clustering for Mining in a Data Warehousing Environment
Data warehouses provide a great deal of opportunities for performing data mining tasks such as classification and clustering. Typically, updates are collected and applied to the d...
Martin Ester, Hans-Peter Kriegel, Jörg Sander...
SIGSOFT
2005
ACM
15 years 3 months ago
Detecting higher-level similarity patterns in programs
Cloning in software systems is known to create problems during software maintenance. Several techniques have been proposed to detect the same or similar code fragments in software...
Hamid Abdul Basit, Stan Jarzabek
97
Voted
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 1 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar