Sciweavers

150 search results - page 18 / 30
» Obtaining and Evaluating Generalized Association Rules
Sort
View
ATAL
2010
Springer
14 years 10 months ago
False-name-proofness with bid withdrawal
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
Mingyu Guo, Vincent Conitzer
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
15 years 10 months ago
Frequent term-based text clustering
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
Florian Beil, Martin Ester, Xiaowei Xu
DATAMINE
1999
152views more  DATAMINE 1999»
14 years 9 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
85
Voted
WWW
2009
ACM
15 years 10 months ago
Deducing trip related information from flickr
Uploading tourist photos is a popular activity on photo sharing platforms. These photographs and their associated metadata (tags, geo-tags, and temporal information) should be use...
Adrian Popescu, Gregory Grefenstette
62
Voted
QEST
2005
IEEE
15 years 3 months ago
QBDs with Marked Time Epochs: a Framework for Transient Performance Measures
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
Benny Van Houdt, Chris Blondia