Industry
Personalized Ranking Metric Embedding for Next New POI Recommendation
Feng, Shanshan (Nanyang Technological University) | Li, Xutao (Nanyang Technological University) | Zeng, Yifeng (Teesside University) | Cong, Gao (Nanyang Technological University) | Chee, Yeow Meng (Nanyang Technological University) | Yuan, Quan (Nanyang Technological University)
The rapidly growing of Location-based Social Networks (LBSNs) provides a vast amount of check-in data, which enables many services, e.g., point-of-interest (POI) recommendation. In this paper, we study the next new POI recommendation problem in which new POIs with respect to users' current location are to be recommended. The challenge lies in the difficulty in precisely learning users' sequential information and personalizing the recommendation model. To this end, we resort to the Metric Embedding method for the recommendation, which avoids drawbacks of the Matrix Factorization technique. We propose a personalized ranking metric embedding method (PRME) to model personalized check-in sequences. We further develop a PRME-G model, which integrates sequential information, individual preference, and geographical influence, to improve the recommendation performance. Experiments on two real-world LBSN datasets demonstrate that our new algorithm outperforms the state-of-the-art next POI recommendation methods.
Personalized Ranking Metric Embedding for Next New POI Recommendation
Feng, Shanshan (Nanyang Technological University) | Li, Xutao (Nanyang Technological University) | Zeng, Yifeng (Teesside University) | Cong, Gao (Nanyang Technological University) | Chee, Yeow Meng (Nanyang Technological University) | Yuan, Quan (Nanyang Technological University)
The rapidly growing of Location-based Social Networks (LBSNs) provides a vast amount of check-in data, which enables many services, e.g., point-of-interest (POI) recommendation. In this paper, we study the next new POI recommendation problem in which new POIs with respect to users' current location are to be recommended. The challenge lies in the difficulty in precisely learning users' sequential information and personalizing the recommendation model. To this end, we resort to the Metric Embedding method for the recommendation, which avoids drawbacks of the Matrix Factorization technique. We propose a personalized ranking metric embedding method (PRME) to model personalized check-in sequences. We further develop a PRME-G model, which integrates sequential information, individual preference, and geographical influence, to improve the recommendation performance. Experiments on two real-world LBSN datasets demonstrate that our new algorithm outperforms the state-of-the-art next POI recommendation methods.
Personalized Ranking Metric Embedding for Next New POI Recommendation
Feng, Shanshan (Nanyang Technological University) | Li, Xutao (Nanyang Technological University) | Zeng, Yifeng (Teesside University) | Cong, Gao (Nanyang Technological University) | Chee, Yeow Meng (Nanyang Technological University) | Yuan, Quan (Nanyang Technological University)
The rapidly growing of Location-based Social Networks (LBSNs) provides a vast amount of check-in data, which enables many services, e.g., point-of-interest (POI) recommendation. In this paper, we study the next new POI recommendation problem in which new POIs with respect to users' current location are to be recommended. The challenge lies in the difficulty in precisely learning users' sequential information and personalizing the recommendation model. To this end, we resort to the Metric Embedding method for the recommendation, which avoids drawbacks of the Matrix Factorization technique. We propose a personalized ranking metric embedding method (PRME) to model personalized check-in sequences. We further develop a PRME-G model, which integrates sequential information, individual preference, and geographical influence, to improve the recommendation performance. Experiments on two real-world LBSN datasets demonstrate that our new algorithm outperforms the state-of-the-art next POI recommendation methods.
Personalized Ranking Metric Embedding for Next New POI Recommendation
Feng, Shanshan (Nanyang Technological University) | Li, Xutao (Nanyang Technological University) | Zeng, Yifeng (Teesside University) | Cong, Gao (Nanyang Technological University) | Chee, Yeow Meng (Nanyang Technological University) | Yuan, Quan (Nanyang Technological University)
The rapidly growing of Location-based Social Networks (LBSNs) provides a vast amount of check-in data, which enables many services, e.g., point-of-interest (POI) recommendation. In this paper, we study the next new POI recommendation problem in which new POIs with respect to users' current location are to be recommended. The challenge lies in the difficulty in precisely learning users' sequential information and personalizing the recommendation model. To this end, we resort to the Metric Embedding method for the recommendation, which avoids drawbacks of the Matrix Factorization technique. We propose a personalized ranking metric embedding method (PRME) to model personalized check-in sequences. We further develop a PRME-G model, which integrates sequential information, individual preference, and geographical influence, to improve the recommendation performance. Experiments on two real-world LBSN datasets demonstrate that our new algorithm outperforms the state-of-the-art next POI recommendation methods.
CoBots: Robust Symbiotic Autonomous Mobile Service Robots
Veloso, Manuela (Carnegie Mellon University) | Biswas, Joydeep (Carnegie Mellon University) | Coltin, Brian (Carnegie Mellon University) | Rosenthal, Stephanie (Carnegie Mellon University)
We research and develop autonomous mobile service robots as Collaborative Robots, i.e., CoBots. For the last three years, our four CoBots have autonomously navigated in our multi-floor office buildings for more than 1,000km, as the result of the integration of multiple perceptual, cognitive, and actuations representations and algorithms. In this paper, we identify a few core aspects of our CoBots underlying their robust functionality. The reliable mobility in the varying indoor environments comes from a novel episodic non-Markov localization. Service tasks requested by users are the input to a scheduler that can consider different types of constraints, including transfers among multiple robots. With symbiotic autonomy, the CoBots proactively seek external sources of help to fill-in for their inevitable occasional limitations. We present sampled results from a deployment and conclude with a brief review of other features of our service robots.
Activity-based Scheduling of Science Campaigns for the Rosetta Orbiter
Chien, Steve (Jet Propulsion Laboratory, California Institute of Technology) | Rabideau, Gregg (Jet Propulsion Laboratory, California Institute of Technology) | Tran, Daniel (Jet Propulsion Laboratory, California Institute of Technology) | Troesch, Martina (Jet Propulsion Laboratory, California Institute of Technology) | Doubleday, Joshua (Jet Propulsion Laboratory, California Institute of Technology) | Nespoli, Federico (European Space Astronomy Center, European Space Agency) | Ayucar, Miguel Perez (European Space Astronomy Center, European Space Agency) | Sitja, Marc Costa (European Space Astronomy Center, European Space Agency) | Vallat, Claire (European Space Astronomy Center, European Space Agency) | Geiger, Bernhard (European Space Astronomy Center, European Space Agency) | Altobelli, Nico (European Space Astronomy Center, European Space Agency) | Fernandez, Manuel (European Space Astronomy Center, European Space Agency) | Vallejo, Fran (European Space Astronomy Center, European Space Agency) | Andres, Rafael (European Space Astronomy Center, European Space Agency) | Kueppers, Michael (European Space Astronomy Center, European Space Agency)
Rosetta is a European Space Agency (ESA) cornerstone mission that entered orbit around the comet 67P/Churyumov-Gerasimenko in August 2014 and will escort the comet for a 1.5 year nominal mission offering the most detailed study of a comet ever undertaken by humankind. The Rosetta orbiter has 11 scientific instruments (4 remote sensing) and the Philae lander to make complementary measurements of the comet nucleus, coma (gas and dust), and surrounding environment. The ESA Rosetta Science Ground Segment has developed a science scheduling system that includes an automated scheduling capability to assist in developing science plans for the Rosetta Orbiter. While automated scheduling is a small portion of the overall Science Ground Segment (SGS) as well as the overall scheduling system, this paper focuses on the automated and semi-automated scheduling software (called ASPEN-RSSC) and how this software is used.
The Spatio-Temporal Representation of Natural Reading
Wehbe, Leila (Carnegie Mellon University)
We set out to challenge the understanding that it is difficult My work is an integrated interdisciplinary effort which employs to study the complex processing of natural stories. We used functional neuroimaging, and revolves around the development functional Magnetic Resonance Imaging (fMRI) to record the of machine learning methods to uncover multilayer brain activity of subjects while they read an unmodified chapter cognitive processes from brain activity recordings. of a popular book. Unprecedently, we modeled the measured Studying how the human brain represents meaning is not brain activity as a function of the content of the text only important for expanding our scientific knowledge of the being read Wehbe et al. [2014a]. Our model is able to extrapolate brain and of intelligence. By mapping behavioral traits to differences to predict brain activity for novel passages of text - in brain representations, we increase our understanding beyond those on which it has been trained.
Quantifying and Improving the Robustness of Trust Systems
Wang, Dongxia (Nanyang Technological University)
Trust systems are widely used to facilitate interactions among agents based on trust evaluation. These systems may have robustness issues, that is, they are affected by various attacks. Designers of trust systems propose methods to defend against these attacks. However, they typically verify the robustness of their defense mechanisms (or trust models) only under specific attacks. This raises problems: first, the robustness of their models is not guaranteed as they do not consider all attacks. Second, the comparison between two trust models depends on the choice of specific attacks, introducing bias. We propose to quantify the strength of attacks, and to quantify the robustness of trust systems based on the strength of the attacks it can resist.Our quantification is based on information theory, and provides designers of trust systems a fair measurement of the robustness.
Unleashing the Power of Multi-Agent Voting Teams
Marcolino, Leandro Soriano (University of Southern California)
Such prediction is important to take remedy procedures to increase a team's performance. Existing Teams of voting agents have great potential in finding methods are tailored for specific domains [Ramos and optimal solutions. However, there are fundamental Ayanegui, 2008]. In Nagarajan et al. [2015] I introduce a challenges to effectively use such teams: (i) novel domain independent technique, which learns a prediction selecting agents; (ii) aggregating opinions; (iii) assessing function using only the voting patterns of a team.
Automated Agents for Advice Provision
Rosenfeld, Ariel (Bar-Ilan University)
In this thesis, we focus on automated advising agents. The advice given is a form of relating recommendations or guidance from an automated agent to its human user. Providing the right advice at the right time is extremely complex, and requires a good adaptation to human desires and changing environments. We propose a novel methodology for designing automated advising agents and evaluate it in three real world environments. Our intelligent advising agents were evaluated through extensive field trials, with hundreds of human subjects. A significant increase in human performance as well as a high level of user satisfaction was recorded when they were equipped with our agents.