Sciweavers

302 search results - page 58 / 61
» Efficient frequent pattern mining over data streams
Sort
View
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
15 years 10 months ago
Practical learning from one-sided feedback
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
D. Sculley
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 2 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
ICS
2010
Tsinghua U.
15 years 1 days ago
InterferenceRemoval: removing interference of disk access for MPI programs through data replication
As the number of I/O-intensive MPI programs becomes increasingly large, many efforts have been made to improve I/O performance, on both software and architecture sides. On the sof...
Xuechen Zhang, Song Jiang
HICSS
2006
IEEE
124views Biometrics» more  HICSS 2006»
15 years 3 months ago
Gatekeeping in Virtual Communities: On Politics of Power in Cyberspace
Gatekeeping/Information Control is exercised frequently and daily in virtual communities. Gatekeeping exists in four different levels: Regulators, service providers, communitiesâ€...
Karine Barzilai-Nahon
DATAMINE
2002
104views more  DATAMINE 2002»
14 years 9 months ago
Cubegrades: Generalizing Association Rules
Cubegrades are generalization of association rules which represent how a set of measures (aggregates) is affected by modifying a cube through specialization (rolldown), generaliza...
Tomasz Imielinski, Leonid Khachiyan, Amin Abdulgha...