Sciweavers

6300 search results - page 1199 / 1260
» We have it easy, but do we have it right
Sort
View
115
Voted
KDD
2009
ACM
162views Data Mining» more  KDD 2009»
16 years 1 months ago
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Collaborative filtering is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it cannot make recommendations ...
Mohsen Jamali, Martin Ester
116
Voted
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 1 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 1 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
117
Voted
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
16 years 1 months ago
Learning nonstationary models of normal network traffic for detecting novel attacks
Traditional intrusion detection systems (IDS) detect attacks by comparing current behavior to signatures of known attacks. One main drawback is the inability of detecting new atta...
Matthew V. Mahoney, Philip K. Chan
CHI
2008
ACM
16 years 1 months ago
ArtLinks: fostering social awareness and reflection in museums
Technologies in museums often support learning goals, providing information about exhibits. However, museum visitors also desire meaningful experiences and enjoy the social aspect...
Dan Cosley, Joel Lewenstein, Andrew Herman, Jenna ...
« Prev « First page 1199 / 1260 Last » Next »