Results 1 - 10
of
16,996
K Similar Users Candidates
"... Online dating sites are used by millions of people Our overall goal is to improve matching between people in online dating. Recommendation Algorithm To generate potential matches for a user U: • Find the K most similar users based on user profile • For each of these K similar users, compute a candid ..."
Abstract
- Add to MetaCart
Online dating sites are used by millions of people Our overall goal is to improve matching between people in online dating. Recommendation Algorithm To generate potential matches for a user U: • Find the K most similar users based on user profile • For each of these K similar users, compute a
Discovering Similar Users on Twitter
"... ABSTRACT This work studies the problem of discovering "similar" users at Twitter, where we define two users to be similar if they produce content similar to each other. The discovery of top similar accounts for each Twitter user has a variety of applications at Twitter including user reco ..."
Abstract
- Add to MetaCart
ABSTRACT This work studies the problem of discovering "similar" users at Twitter, where we define two users to be similar if they produce content similar to each other. The discovery of top similar accounts for each Twitter user has a variety of applications at Twitter including user
Finding similar users in Facebook
"... Online social networks are rapidly asserting themselves as popular services on the Web. A central point is to determine whether two distinct users can be considered similar, a crucial concept with interesting consequences on the possibility to accomplish targeted actions like, for example, political ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Online social networks are rapidly asserting themselves as popular services on the Web. A central point is to determine whether two distinct users can be considered similar, a crucial concept with interesting consequences on the possibility to accomplish targeted actions like, for example
Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes
, 1996
"... Recently the notion of self-similarity has been shown to apply to wide-area and local-area network traffic. In this paper we examine the mechanisms that give rise to the self-similarity of network traffic. We present a hypothesized explanation for the possible self-similarity of traffic by using a p ..."
Abstract
-
Cited by 1416 (26 self)
- Add to MetaCart
, we show evidence that WWW traffic exhibits behavior that is consistent with self-similar traffic models. Then we show that the self-similarity insuch traffic can be explained based on the underlying distributions of WWW document sizes, the effects of caching and user preference in le transfer
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
, 2002
"... Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (sch ..."
Abstract
-
Cited by 592 (12 self)
- Add to MetaCart
matter of fact, we evaluate the ‘accuracy ’ of the algorithm by counting the number of needed adjustments. We conducted a user study, in which our accuracy metric was used to estimate the labor savings that the users could obtain by utilizing our algorithm to obtain an initial matching. Finally, we
USER ACCEPTANCE OF INFORMATION TECHNOLOGY: TOWARD A UNIFIED VIEW
, 2003
"... Information technology (IT) acceptance research has yielded many competing models, each with different sets of acceptance determinants. In this paper, we (1) review user acceptance literature and discuss eight prominent models, (2) empirically compare the eight models and their extensions, (3) formu ..."
Abstract
-
Cited by 1807 (10 self)
- Add to MetaCart
Information technology (IT) acceptance research has yielded many competing models, each with different sets of acceptance determinants. In this paper, we (1) review user acceptance literature and discuss eight prominent models, (2) empirically compare the eight models and their extensions, (3
Social Information Filtering: Algorithms for Automating "Word of Mouth"
, 1995
"... This paper describes a technique for making personalized recommendations from any type of database to a user based on similarities between the interest profile of that user and those of other users. In particular, we discuss the implementation of a networked system called Ringo, which makes personal ..."
Abstract
-
Cited by 1159 (20 self)
- Add to MetaCart
This paper describes a technique for making personalized recommendations from any type of database to a user based on similarities between the interest profile of that user and those of other users. In particular, we discuss the implementation of a networked system called Ringo, which makes
Why We Twitter: Understanding Microblogging Usage and Communities
"... Microblogging is a new form of communication in which users can describe their current status in short posts distributed by instant messages, mobile phones, email or the Web. Twitter, a popular microblogging tool has seen a lot of growth since it launched in October, 2006. In this paper, we present ..."
Abstract
-
Cited by 576 (2 self)
- Add to MetaCart
community level and show how users with similar intentions connect with each other.
VisualSEEk: a fully automated content-based image query system
, 1996
"... We describe a highly functional prototype system for searching by visual features in an image database. The VisualSEEk system is novel in that the user forms the queries by diagramming spatial arrangements of color regions. The system finds the images that contain the most similar arrangements of ..."
Abstract
-
Cited by 762 (31 self)
- Add to MetaCart
We describe a highly functional prototype system for searching by visual features in an image database. The VisualSEEk system is novel in that the user forms the queries by diagramming spatial arrangements of color regions. The system finds the images that contain the most similar arrangements
Distance metric learning, with application to clustering with sideinformation,”
- in Advances in Neural Information Processing Systems 15,
, 2002
"... Abstract Many algorithms rely critically on being given a good metric over their inputs. For instance, data can often be clustered in many "plausible" ways, and if a clustering algorithm such as K-means initially fails to find one that is meaningful to a user, the only recourse may be for ..."
Abstract
-
Cited by 818 (13 self)
- Add to MetaCart
be for the user to manually tweak the input space's metric until sufficiently good clusters are found. For these and other applications requiring good metrics, it is desirable that we provide a more systematic way for users to indicate what they consider "similar." For instance, we may ask them
Results 1 - 10
of
16,996