AAAI 2010 - PDF Preprint Papers

AAAI 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed AAAI-2010 Paper

click to vote

AAAI
2010

426views Intelligent Agents» more AAAI 2010»

Transfer Learning in Collaborative Filtering for Sparsity Reduction

14 years 1 months ago

Download www.cse.ust.hk

Data sparsity is a major problem for collaborative filtering (CF) techniques in recommender systems, especially for new users and items. We observe that, while our target data are...

Weike Pan, Evan Wei Xiang, Nathan Nan Liu, Qiang Y...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	426	Transfer Learning in Collaborative Filtering for Sparsity Reduction	claim
2	382	Unsupervised Learning of Event Classes from Video	claim
3	276	Automated Program Debugging Via Multiple Predicate Switching	claim
4	273	Efficient Spectral Feature Selection with Minimum Redundancy	claim
5	269	A Layered Approach to People Detection in 3D Range Data	claim
6	267	Recognizing Multi-Agent Activities from GPS Data	claim
7	260	Symmetry Detection in General Game Playing	claim
8	259	A Two-Dimensional Topic-Aspect Model for Discovering Multi-Faceted Topics	claim
9	251	Non-I.I.D. Multi-Instance Dimensionality Reduction by Learning a Maximum Bag Margin Subspace	claim
10	245	UserRec: A User Recommendation Framework in Social Tagging Systems	claim
11	244	Visual Contextual Advertising: Bringing Textual Advertisements to Images	claim
12	237	Modeling Dynamic Multi-Topic Discussions in Online Forums	claim
13	236	Biologically-Inspired Control for Multi-Agent Self-Adaptive Tasks	claim
14	236	Efficient Belief Propagation for Utility Maximization and Repeated Inference	claim
15	235	Multi-Label Learning with Weak Label	claim
16	232	Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games	claim
17	229	Node Selection Query Languages for Trees	claim
18	227	A Bayesian Nonparametric Approach to Modeling Mobility Patterns	claim
19	224	Adaptive Transfer Learning	claim
20	222	A Belief Revision Framework for Revising Epistemic States with Partial Epistemic States	claim
21	222	News Recommendation in Forum-Based Social Media	claim
22	222	Diversifying Query Suggestion Results	claim
23	222	Ordered Completion for First-Order Logic Programs on Finite Structures	claim
24	219	Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search	claim
25	219	Bayesian Matrix Factorization with Side Information and Dirichlet Process Mixtures	claim
26	218	Multi-Agent Plan Recognition: Formalization and Algorithms	claim
27	218	Distributed Auction-Based Initialization of Mobile Robot Formations	claim
28	216	An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games	claim
29	215	Searching Without a Heuristic: Efficient Use of Abstraction	claim
30	215	Toward Learning to Press Doorbell Buttons	claim
31	214	An Integrated Systems Approach to Explanation-Based Conceptual Change	claim
32	214	Community-Guided Learning: Exploiting Mobile Sensor Users to Model Human Behavior	claim
33	214	Multi-Instance Dimensionality Reduction	claim
34	214	Multilinear Maximum Distance Embedding Via L1-Norm Optimization	claim
35	213	How Incomplete Is Your Semantic Web Reasoner?	claim
36	212	Approximation Algorithms and Mechanism Design for Minimax Approval Voting	claim
37	211	Fast Algorithms for Top-k Approximate String Matching	claim
38	211	Online Learning of Uneven Terrain for Humanoid Bipedal Walking	claim
39	210	Informed Lifting for Message-Passing	claim
40	209	Parallel Depth First Proof Number Search	claim
41	208	Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search	claim
42	207	Coalitional Structure Generation in Skill Games	claim
43	206	Decision-Theoretic Control of Crowd-Sourced Workflows	claim
44	206	Reasoning about Imperfect Information Games in the Epistemic Situation Calculus	claim
45	204	Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D	claim
46	201	Activity and Gait Recognition with Time-Delay Embeddings	claim
47	201	Compressing POMDPs Using Locality Preserving Non-Negative Matrix Factorization	claim
48	200	Cost-Sensitive Semi-Supervised Support Vector Machine	claim
49	199	Adopting Inference Networks for Online Thread Retrieval	claim
50	199	Computationally Feasible Automated Mechanism Design: General Approach and Case Studies	claim
51	199	Bayesian Policy Search for Multi-Agent Role Discovery	claim
52	198	Automatic Derivation of Finite-State Machines for Behavior Control	claim
53	198	A Topic Model for Linked Documents and Update Rules for its Estimation	claim
54	197	Asymmetric Spite in Auctions	claim
55	197	Accounting Mechanisms for Distributed Work Systems	claim
56	196	Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments	claim
57	196	Toward an Architecture for Never-Ending Language Learning	claim
58	195	Facial Age Estimation by Learning from Label Distributions	claim
59	195	Kernelized Sorting for Natural Language Processing	claim
60	194	Learning Simulation Control in General Game-Playing Agents	claim
61	193	Towards an Intelligent Code Search Engine	claim
62	193	The Boosting Effect of Exploratory Behaviors	claim
63	192	Collusion Detection in Online Bridge	claim
64	191	Relative Entropy Policy Search	claim
65	191	Intelligently Aiding Human-Guided Correction of Speech Recognition	claim
66	191	Exploiting Monotonicity in Interval Constraint Propagation	claim
67	189	Facilitating the Evaluation of Automated Negotiators using Peer Designed Agents	claim
68	189	Error Aware Monocular Visual Odometry using Vertical Line Pairs for Small Robots in Urban Areas	claim
69	188	Forest-Based Semantic Role Labeling	claim
70	188	An Optimization Variant of Multi-Robot Path Planning Is Intractable	claim
71	186	A General Game Description Language for Incomplete Information Games	claim
72	186	Fast Conditional Density Estimation for Quantitative Structure-Activity Relationships	claim
73	185	Constraint Programming for Data Mining and Machine Learning	claim
74	185	Symbolic Dynamic Programming for First-order POMDPs	claim
75	185	Conformal Mapping by Computationally Efficient Methods	claim
76	185	PUMA: Planning Under Uncertainty with Macro-Actions	claim
77	185	Semantic Search in Linked Data: Opportunities and Challenges	claim
78	183	Goal-Driven Autonomy in a Navy Strategy Simulation	claim
79	183	Finding Semantic Inconsistencies in UMLS using Answer Set Programming	claim
80	183	The Genetic Algorithm as a General Diffusion Model for Social Networks	claim
81	182	Coalition Structure Generation based on Distributed Constraint Optimization	claim
82	181	Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates	claim
83	181	Finding Optimal Solutions to Cooperative Pathfinding Problems	claim
84	180	Sequential Incremental-Value Auctions	claim
85	180	Relational Partially Observable MDPs	claim
86	180	g-Planner: Real-time Motion Planning and Global Navigation using GPUs	claim
87	180	Exact Algorithms and Experiments for Hierarchical Tree Clustering	claim
88	179	Integrating a Closed World Planner with an Open World Robot: A Case Study	claim
89	179	Optimal Strategies for Reviewing Search Results	claim
90	178	Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction	claim
91	178	Can Approximation Circumvent Gibbard-Satterthwaite?	claim
92	178	Multi-Task Active Learning with Output Constraints	claim
93	177	Gaussian Mixture Model with Local Consistency	claim
94	175	Past and Future of DL-Lite	claim
95	175	Integrated Systems for Inducing Spatio-Temporal Process Models	claim
96	174	To Max or Not to Max: Online Learning for Speeding Up Optimal Planning	claim
97	173	Integrating Sample-Based Planning and Model-Based Reinforcement Learning	claim
98	173	Evolving Compiler Heuristics to Manage Communication and Contention	claim
99	173	First-Order Indefinability of Answer Set Programs on Finite Structures	claim
100	172	Private and Third-Party Randomization in Risk-Sensitive Equilibrium Concepts	claim
101	172	Compilation Complexity of Common Voting Rules	claim
102	172	Knowledge Compilation in the Modal Logic S5	claim
103	172	Using Bisimulation for Policy Transfer in MDPs	claim
104	171	Multi-Agent Learning with Policy Prediction	claim
105	171	Reinforcement Learning via AIXI Approximation	claim
106	170	Single-Frontier Bidirectional Search	claim
107	170	Stackelberg Voting Games: Computational Aspects and Paradoxes	claim
108	170	A Restriction of Extended Resolution for Clause Learning SAT Solvers	claim
109	170	Efficient Lifting for Online Probabilistic Inference	claim
110	170	Search-Based Path Planning with Homotopy Class Constraints	claim
111	169	Multi-Task Sparse Discriminant Analysis (MtSDA) with Overlapping Categories	claim
112	168	Integrating Expert Knowledge and Experience	claim
113	168	Collaborative Filtering Meets Mobile Recommendation: A User-Centered Approach	claim
114	168	Truth, Justice, and Cake Cutting	claim
115	168	Propagating Conjunctions of AllDifferent Constraints	claim
116	168	Task Space Behavior Learning for Humanoid Robots using Gaussian Mixture Models	claim
117	167	Control Model Learning for Whole-Body Mobile Manipulation	claim
118	167	Ad Hoc Autonomous Agent Teams: Collaboration without Pre-Coordination	claim
119	167	Good Rationalizations of Voting Rules	claim
120	166	Smooth Optimization for Effective Multiple Kernel Learning	claim
121	166	A Cross-Entropy Method that Optimizes Partially Decomposable Problems: A New Way to Interpret NMR Spectra	claim
122	164	Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs	claim
123	164	Continual On-Line Planning	claim
124	164	Creating Dynamic Story Plots with Continual Multiagent Planning	claim
125	164	Learning Causal Models of Relational Domains	claim
126	163	Structured Parameter Elicitation	claim
127	163	Trial-Based Dynamic Programming for Multi-Agent Planning	claim
128	163	Computing Cost-Optimal Definitely Discriminating Tests	claim
129	162	Hierarchical Skill Learning for High-Level Planning	claim
130	162	Inducing Probability Distributions from Knowledge Bases with (In)dependence Relations	claim
131	161	Learning Methods to Generate Good Plans: Integrating HTN Learning and Reinforcement Learning	claim
132	161	Materializing Inferred and Uncertain Knowledge in RDF Datasets	claim
133	161	Myopic Policies for Budgeted Optimization with Constrained Experiments	claim
134	160	Envy Quotes and the Iterated Core-Selecting Combinatorial Auction	claim
135	160	A Temporal Proof System for General Game Playing	claim
136	159	New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence	claim
137	159	Simultaneous Elicitation of Preference Features and Utility	claim
138	158	Independent Additive Heuristics Reduce Search Multiplicatively	claim
139	158	G-Optimal Design with Laplacian Regularization	claim
140	157	Soundness Preserving Approximation for TBox Reasoning	claim
141	156	A Stronger Consistency for Soft Global Constraints in Weighted Constraint Satisfaction	claim
142	156	Convergence to Equilibria in Plurality Voting	claim
143	156	Panlingual Lexical Translation via Probabilistic Inference	claim
144	156	A Single-Step Maximum A Posteriori Update for Bearing-Only SLAM	claim
145	155	Genome Rearrangement: A Planning Approach	claim
146	154	A Probabilistic-Logical Framework for Ontology Matching	claim
147	154	Collaborative Expert Portfolio Management	claim
148	154	Towards Multiagent Meta-level Control	claim
149	154	Assisting Users with Clustering Tasks by Combining Metric Learning and Classification	claim
150	153	Local Search in Histogram Construction	claim
151	153	SAP Speaks PDDL	claim
152	153	Dynamic Auction: A Tractable Auction Procedure	claim
153	153	Ontologies and Representations of Matter	claim
154	152	Structure Learning for Markov Logic Networks with Many Descriptive Attributes	claim
155	152	Integrating Reinforcement Learning into a Programming Language	claim
156	152	Beyond Equilibrium: Predicting Human Behavior in Normal-Form Games	claim
157	151	Automated Channel Abstraction for Advertising Auctions	claim
158	151	Biped Walk Learning Through Playback and Corrective Demonstration	claim
159	150	Intentions in Equilibrium	claim
160	150	Fixing a Tournament	claim
161	150	Hidden Market Design	claim
162	149	Filtering Bounded Knapsack Constraints in Expected Sublinear Time	claim
163	149	Latent Class Models for Algorithm Portfolio Methods	claim
164	148	Exploiting QBF Duality on a Circuit Representation	claim
165	147	Using Imagery to Simplify Perceptual Abstraction in Reinforcement Learning Agents	claim
166	147	Progress on Agent Coordination with Cooperative Auctions	claim
167	147	Discovering Long Range Properties of Social Networks with Multi-Valued Time-Inhomogeneous Models	claim
168	147	Prioritization of Domain-Specific Web Information Extraction	claim
169	147	Grouping Strokes into Shapes in Hand-Drawn Diagrams	claim
170	146	Learning Spatial-Temporal Varying Graphs with Applications to Climate Data Analysis	claim
171	146	Security Games with Arbitrary Schedules: A Branch and Price Approach	claim
172	146	Active Inference for Collective Classification	claim
173	145	Generalized Task Markets for Human and Machine Computation	claim
174	145	Epsilon-First Policies for Budget-Limited Multi-Armed Bandits	claim
175	145	A New Algorithm for Weighted Partial MaxSAT	claim
176	145	1.6-Bit Pattern Databases	claim
177	144	High-Quality Policies for the Canadian Traveler's Problem	claim
178	144	On the Reputation of Agent-Based Web Services	claim
179	144	Planning in Dynamic Environments: Extending HTNs with Nonlinear Continuous Effects	claim
180	144	Representation Discovery in Sequential Decision Making	claim
181	144	Lifting Rationality Assumptions in Binary Aggregation	claim
182	144	Computational Social Choice: Strategic and Combinatorial Aspects	claim
183	144	A Trust Model for Supply Chain Management	claim
184	143	Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection	claim
185	143	Integrating Transfer Learning in Synthetic Student	claim
186	143	Integrity Constraints in OWL	claim
187	142	A Distributed Method for Evaluating Properties of a Robot Formation	claim
188	141	Detecting Social Ties and Copying Events from Affiliation Data	claim
189	141	Two-Player Game Structures for Generalized Planning and Agent Composition	claim
190	141	A General Framework for Representing and Reasoning with Annotated Semantic Web Data	claim
191	141	Enhancing Affective Communication in Embodied Conversational Agents	claim
192	140	The Model-Based Approach to Autonomous Behavior: A Personal View	claim
193	139	Possible Winners when New Candidates Are Added: The Case of Scoring Rules	claim
194	139	Using Lookaheads with Optimal Best-First Search	claim
195	138	Voting Almost Maximizes Social Welfare Despite Limited Communication	claim
196	138	A Lower Bound on the Size of Decomposable Negation Normal Form	claim
197	137	Dominance Testing via Model Checking	claim
198	137	Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners	claim
199	136	Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies	claim
200	136	Probabilistic Possible Winner Determination	claim
201	136	Algorithms for Finding Approximate Formations in Games	claim
202	134	Reinforcement Learning Via Practice and Critique Advice	claim
203	134	Multi-Agent Fault Tolerance Inspired by a Computational Analysis of Cancer	claim
204	134	A Novel Transition Based Encoding Scheme for Planning as Satisfiability	claim
205	134	Using Closed Captions as Supervision for Video Activity Recognition	claim
206	133	Utilizing Context in Generative Bayesian Models for Linked Corpus	claim
207	132	A Decentralised Coordination Algorithm for Mobile Sensors	claim
208	132	Cloning in Elections	claim
209	131	SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs	claim
210	126	Predicting the Importance of Newsfeed Posts and Social Network Friends	claim
211	126	User-Specific Learning for Recognizing a Singer's Intended Pitch	claim
212	124	Local Optimization for Simulation of Natural Motion	claim
213	120	Transmission Network Expansion Planning with Simulation Optimization	claim
214	118	Interactive Learning Using Manifold Geometry	claim
215	114	Temporal Information Extraction	claim
216	114	What Is an Opinion About? Exploring Political Standpoints Using Opinion Scoring Model	claim
217	107	A First Practical Algorithm for High Levels of Relational Consistency	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers