Sciweavers

14386 search results - page 2587 / 2878
» The Chinese Generals Problem
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 7 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 7 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
16 years 7 months ago
Experimental design for solicitation campaigns
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...
Uwe F. Mayer, Armand Sarkissian
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
16 years 7 months ago
Web site mining: a new way to spot competitors, customers and suppliers in the world wide web
When automatically extracting information from the world wide web, most established methods focus on spotting single HTMLdocuments. However, the problem of spotting complete web s...
Martin Ester, Hans-Peter Kriegel, Matthias Schuber...
CHI
2006
ACM
16 years 7 months ago
Talk to me: foundations for successful individual-group interactions in online communities
People come to online communities seeking information, encouragement, and conversation. When a community responds, participants benefit and become more committed. Yet interactions...
Jaime Arguello, Brian S. Butler, Elisabeth Joyce, ...
« Prev « First page 2587 / 2878 Last » Next »