Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
5,757
Particle swarm optimization recommender system
- Proceedings of the IEEE Swarm Intelligence Symposium 2003 (SIS 2003
, 2003
"... Abstract – Recommender systems are new types of internet-based software tools, designed to help users find their way through today’s complex on-line shops and entertainment websites. This paper describes a new recommender system, which employs a particle swarm optimization (PSO) algorithm to learn p ..."
Abstract
-
Cited by 21 (1 self)
- Add to MetaCart
Abstract – Recommender systems are new types of internet-based software tools, designed to help users find their way through today’s complex on-line shops and entertainment websites. This paper describes a new recommender system, which employs a particle swarm optimization (PSO) algorithm to learn
Particle Swarm Optimization Recommender System
"... Abstract – Recommender systems are new types of internet-based software tools, designed to help users find their way through today’s complex on-line shops and entertainment websites. This paper describes a new recommender system, which employs a particle swarm optimization (PSO) algorithm to learn p ..."
Abstract
- Add to MetaCart
Abstract – Recommender systems are new types of internet-based software tools, designed to help users find their way through today’s complex on-line shops and entertainment websites. This paper describes a new recommender system, which employs a particle swarm optimization (PSO) algorithm to learn
Internet traffic engineering by optimizing OSPF weights
- in Proc. IEEE INFOCOM
, 2000
"... Abstract—Open Shortest Path First (OSPF) is the most commonly used intra-domain internet routing protocol. Traffic flow is routed along shortest paths, splitting flow at nodes where several outgoing links are on shortest paths to the destination. The weights of the links, and thereby the shortest pa ..."
Abstract
-
Cited by 403 (13 self)
- Add to MetaCart
path routes, can be changed by the network operator. The weights could be set proportional to their physical distances, but often the main goal is to avoid congestion, i.e. overloading of links, and the standard heuristic recommended by Cisco is to make the weight of a link inversely proportional
The Foundations of Cost-Sensitive Learning
- In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence
, 2001
"... This paper revisits the problem of optimal learning and decision-making when different misclassification errors incur different penalties. We characterize precisely but intuitively when a cost matrix is reasonable, and we show how to avoid the mistake of defining a cost matrix that is economically i ..."
Abstract
-
Cited by 402 (6 self)
- Add to MetaCart
This paper revisits the problem of optimal learning and decision-making when different misclassification errors incur different penalties. We characterize precisely but intuitively when a cost matrix is reasonable, and we show how to avoid the mistake of defining a cost matrix that is economically
Regret-based Optimal Recommendation Sets in Conversational Recommender Systems
, 2009
"... Current conversational recommender systems are unable to offer guarantees on the quality of their recommendations due to a lack of principled user utility models. We develop an approach to recommender systems that incorporates an explicit utility model into the recommendation process in adecision-th ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
-theoretically sound fashion. The system maintains explicit constraints on user utility based on preferences revealed by the user’s actions. We investigate a new decision criterion, setwise minimax regret (SMR), for constructing optimal recommendation sets: we develop algorithms for computing SMR, and prove that SMR
Optimal Recommendations under Attraction, Aversion, and Social Influence
"... People’s interests are dynamically evolving, often affected by ex-ternal factors such as trends promoted by the media or adopted by their friends. In this work, we model interest evolution through dy-namic interest cascades: we consider a scenario where a user’s in-terests may be affected by (a) the ..."
Abstract
- Add to MetaCart
, as a function of the system’s recommendation strategy. We show that, in steady state, the optimal strategy can be computed as the solution of a semi-definite program (SDP). Using datasets of user ratings, we provide evidence for the existence of aversion and attraction in real-life data, and show
Using Maximum Coverage to Optimize Recommendation Systems in E-Commerce∗
"... We study the problem of optimizing recommendation sys-tems for e-commerce sites. We consider in particular a com-binatorial solution to this optimization based on the well known Maximum Coverage problem that asks for the k sets (products) that cover the most elements from a ground set (consumers). T ..."
Abstract
- Add to MetaCart
We study the problem of optimizing recommendation sys-tems for e-commerce sites. We consider in particular a com-binatorial solution to this optimization based on the well known Maximum Coverage problem that asks for the k sets (products) that cover the most elements from a ground set (consumers
Optimal recommendation sets: Covering uncertainty over user preferences
- In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI’05
, 2005
"... We propose an approach to recommendation systems that optimizes over possible sets of recommended alternatives in a decision-theoretic manner. Our approach selects the alternative set that maximizes the expected valuation of the user’s choice from the recommended set. The set-based optimization expl ..."
Abstract
-
Cited by 25 (0 self)
- Add to MetaCart
We propose an approach to recommendation systems that optimizes over possible sets of recommended alternatives in a decision-theoretic manner. Our approach selects the alternative set that maximizes the expected valuation of the user’s choice from the recommended set. The set-based optimization
To parcel or not to parcel: Exploring the question, weighing the merits. Structural Equation Modeling
, 2002
"... We examine the controversial practice of using parcels of items as manifest variables in structural equation modeling (SEM) procedures. After detailing arguments pro and con, we conclude that the unconsidered use of parcels is never warranted, while, at the same time, the considered use of parcels c ..."
Abstract
-
Cited by 286 (14 self)
- Add to MetaCart
of constructs). Prior to creating parcels, however, we recommend strongly that investigators acquire a thorough understanding of the nature and dimensionality of the items to be parceled. With this knowledge in hand, various techniques for creating parcels can be utilized to minimize potential pitfalls
Results 1 - 10
of
5,757
