Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8556)
- Computer Sciences (8539)
- Databases and Information Systems (3453)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1071)
- Numerical Analysis and Scientific Computing (1025)
- Graphics and Human Computer Interfaces (933)
- Engineering (888)
- Social and Behavioral Sciences (681)
- Business (642)
- Theory and Algorithms (493)
- Computer Engineering (451)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (324)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (217)
- Transportation (195)
- Medicine and Health Sciences (181)
- Education (170)
- Management Information Systems (167)
- Data Storage Systems (162)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (110)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (122)
- Social media (74)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Privacy (65)
- Data mining (64)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (54)
- Visualization (51)
- Task analysis (50)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Anomaly detection (47)
- Feature extraction (46)
- Twitter (46)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 6391 - 6420 of 8597
Full-Text Articles in Entire DC Network
Towards Efficient Sparse Coding For Scalable Image Annotation, Junshi Huang, Hairong Liu, Jialie Shen, Shuicheng Yan
Towards Efficient Sparse Coding For Scalable Image Annotation, Junshi Huang, Hairong Liu, Jialie Shen, Shuicheng Yan
Research Collection School Of Computing and Information Systems
Nowadays, content-based retrieval methods are still the development trend of the traditional retrieval systems. Image labels, as one of the most popular approaches for the semantic representation of images, can fully capture the representative information of images. To achieve the high performance of retrieval systems, the precise annotation for images becomes inevitable. However, as the massive number of images in the Internet, one cannot annotate all the images without a scalable and flexible (i.e., training-free) annotation method. In this paper, we particularly investigate the problem of accelerating sparse coding based scalable image annotation, whose off-the-shelf solvers are generally inefficient on …
Hypergraph Index: An Index For Context-Aware Nearest Neighbor Query On Social Networks, Yazhe Wang, Baihua Zheng
Hypergraph Index: An Index For Context-Aware Nearest Neighbor Query On Social Networks, Yazhe Wang, Baihua Zheng
Research Collection School Of Computing and Information Systems
Social network has been touted as the No. 2 innovation in a recent IEEE Spectrum Special Report on “Top 11 Technologies of the Decade”, and it has cemented its status as a bona fide Internet phenomenon. With more and more people starting using social networks to share ideas, activities, events, and interests with other members within the network, social networks contain a huge amount of content. However, it might not be easy to navigate social networks to find specific information. In this paper, we define a new type of queries, namely context-aware nearest neighbor (CANN) search over social network to …
Regret Based Robust Solutions For Uncertain Markov Decision Processes, Asrar Ahmed, Pradeep Reddy Varakantham, Yossiri Adulyasak, Patrick Jaillet
Regret Based Robust Solutions For Uncertain Markov Decision Processes, Asrar Ahmed, Pradeep Reddy Varakantham, Yossiri Adulyasak, Patrick Jaillet
Research Collection School Of Computing and Information Systems
In this paper, we seek robust policies for uncertain Markov Decision Processes (MDPs). Most robust optimization approaches for these problems have focussed on the computation of maximin policies which maximize the value corresponding to the worst realization of the uncertainty. Recent work has proposed minimax regret as a suitable alternative to the maximin objective for robust optimization. However, existing algorithms for handling minimax regret are restricted to models with uncertainty over rewards only. We provide algorithms that employ sampling to improve across multiple dimensions: (a) Handle uncertainties over both transition and reward models; (b) Dependence of model uncertainties across state, …
Engagingness And Responsiveness Behavior Models On The Enron Email Network And Its Application To Email Reply Order Prediction, Byung-Won On, Ee Peng Lim, Jing Jiang, Loo Nin Teow
Engagingness And Responsiveness Behavior Models On The Enron Email Network And Its Application To Email Reply Order Prediction, Byung-Won On, Ee Peng Lim, Jing Jiang, Loo Nin Teow
Research Collection School Of Computing and Information Systems
In email networks, user behaviors affect the way emails are sent and replied. While knowing these user behaviors can help to create more intelligent email services, there has not been much research into mining these behaviors. In this paper, we investigate user engagingness and responsiveness as two interaction behaviors that give us useful insights into how users email one another. Engaging users are those who can effectively solicit responses from other users. Responsive users are those who are willing to respond to other users. By modeling such behaviors, we are able to mine them and to identify engaging or responsive …
Valuation Of Participation In Social Gaming, Kwansoo Kim, Byungjoon Yoo, Robert J. Kauffman
Valuation Of Participation In Social Gaming, Kwansoo Kim, Byungjoon Yoo, Robert J. Kauffman
Research Collection School Of Computing and Information Systems
This study examines the value of the time that a user spends to participate in a social game. We focus on how a massive multiplayer online role-playing game (MMORPG) vendor can establish prices to encourage participation and retain its players. We estimate value through an application of the hedonic pricing model and analyze a data set for an MMORPG in Korea. The results permit us to estimate the value of game-playing time in monetary terms. Based on our empirical results, we propose an economic model and conduct numerical simulation to show how a game vendor can apply differential pricing in …
Cqarank: Jointly Model Topics And Expertise In Community Question Answering, Liu Yang, Minghui Qiu, Swapna Gottopati, Feida Zhu, Jing Jiang, Huiping Sun, Zhong Chen
Cqarank: Jointly Model Topics And Expertise In Community Question Answering, Liu Yang, Minghui Qiu, Swapna Gottopati, Feida Zhu, Jing Jiang, Huiping Sun, Zhong Chen
Research Collection School Of Computing and Information Systems
Community Question Answering (CQA) websites, where people share expertise on open platforms, have become large repositories of valuable knowledge. To bring the best value out of these knowledge repositories, it is critically important for CQA services to know how to find the right experts, retrieve archived similar questions and recommend best answers to new questions. To tackle this cluster of closely related problems in a principled approach, we proposed Topic Expertise Model (TEM), a novel probabilistic generative model with GMM hybrid, to jointly model topics and expertise by integrating textual content model and link structure analysis. Based on TEM results, …
Sensor Feature Selection And Combination For Stress Identification Using Combinatorial Fusion, Yong Deng, Zhonghai Wu, Chao-Hsien Chu, Qixun Zhang, D. Frank Hsu
Sensor Feature Selection And Combination For Stress Identification Using Combinatorial Fusion, Yong Deng, Zhonghai Wu, Chao-Hsien Chu, Qixun Zhang, D. Frank Hsu
Research Collection School Of Computing and Information Systems
The identification of stressfulness under certain driving condition is an important issue for safety, security and health. Sensors and systems have been placed or implemented as wearable devices for drivers. Features are extracted from the data collected and combined to predict symptoms. The challenge is to select the feature set most relevant for stress. In this paper, we propose a feature selection method based on the performance and the diversity between two features. The feature sets selected are then combined using a combinatorial fusion. We also compare our results with other combination methods such as naïve Bayes, support vector machine, …
Symbolic Model-Checking Of Stateful Timed Csp Using Bdd And Digitization, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong
Symbolic Model-Checking Of Stateful Timed Csp Using Bdd And Digitization, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Stateful Timed CSP has been recently proposed to model (and verify) hierarchical real-time systems. It is an expressive modeling language which combines data structure/operations, complicated control flows (modeled using compositional process operators adopted from Timed CSP), and real-time requirements like deadline and within. It has been shown that Stateful Timed CSP is equivalent to closed timed automata with silent transitions, which implies that the timing constraints of Stateful Timed CSP can be captured using explicit tick events, through digitization. In order to tackle the state space explosion problem, we develop a BDD-based symbolic model checking approach to verify Stateful Timed …
Eliciting Usable Gestures For Multi-Display Environments, Teddy Seyed, Chris Burns, Mario Costa Sousa, Frank Maurer, Anthony Tang
Eliciting Usable Gestures For Multi-Display Environments, Teddy Seyed, Chris Burns, Mario Costa Sousa, Frank Maurer, Anthony Tang
Research Collection School Of Computing and Information Systems
Multi-display environments (MDEs) have advanced rapidly in recent years, incorporating multi-touch tabletops, tablets, wall displays and even position tracking systems. Designers have proposed a variety of interesting gestures for use in an MDE, some of which involve a user moving their hands, arms, body or even a device itself. These gestures are often used as part of interactions to move data between the various components of an MDE, which is a longstanding research problem. But designers, not users, have created most of these gestures and concerns over implementation issues such as recognition may have influenced their design. We performed a …
Cross-Lingual Identification Of Ambiguous Discourse Connectives For Resource-Poor Language, Lanjun Zhou, Wei Gao, Binyang Li, Zhongyu Wei, Kam-Fai Wong
Cross-Lingual Identification Of Ambiguous Discourse Connectives For Resource-Poor Language, Lanjun Zhou, Wei Gao, Binyang Li, Zhongyu Wei, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
The lack of annotated corpora brings limitations in research of discourse classification for many languages. In this paper, we present the first effort towards recognizing ambiguities of discourse connectives, which is fundamental to discourse classification for resource-poor language such as Chinese. A language independent framework is proposed utilizing bilingual dictionaries, Penn Discourse Treebank and parallel data between English and Chinese. We start from translating the English connectives to Chinese using a bi-lingual dictionary. Then, the ambiguities in terms of senses a connective may signal are estimated based on the ambiguities of English connectives and word alignment information. Finally, the ambiguity …
Visualization For Anomaly Detection And Data Management By Leveraging Network, Sensor And Gis Techniques, Zhaoxia Wang, Chee Seng Chong, Rick S. M. Goh, Wanqing Zhou, Dan Peng, Hoong Chor Chin
Visualization For Anomaly Detection And Data Management By Leveraging Network, Sensor And Gis Techniques, Zhaoxia Wang, Chee Seng Chong, Rick S. M. Goh, Wanqing Zhou, Dan Peng, Hoong Chor Chin
Research Collection School Of Computing and Information Systems
This paper studies the importance of visualization for discerning and interpreting patterns of data and its application for solving real problems, such as anomaly detection and data management. There are various ways to realize visualization to cater to the needs of numerous real life applications. Depending on needs, a combination of some of these ways may be required for presenting an effective visualization. The authors present visualization schemes for anomaly detection/condition monitoring and data management by leveraging network techniques and combining them with modern techniques such as sensor, database, mobile communication, GPS and GIS techniques. Two case studies are presented …
Finding Thoughtful Comments From Social Media, Gottipati Swapna, Jing Jiang
Finding Thoughtful Comments From Social Media, Gottipati Swapna, Jing Jiang
Research Collection School Of Computing and Information Systems
Online user comments contain valuable user opinions. Comments vary greatly in quality and detecting high quality comments is a subtask of opinion mining and summarization research. Finding attentive comments that provide some reasoning is highly valuable in understanding the user’s opinion particularly in sociopolitical opinion mining and aids policy makers, social organizations or government sectors in decision making. In this paper we study the problem of detecting thoughtful comments. We empirically study various textual features, discourse relations and relevance features to predict thoughtful comments. We use logistic regression model and test on the datasets related to sociopolitical content. We found …
Use Of Rss Feeds To Push The Online Content To Users, Dan Ma
Use Of Rss Feeds To Push The Online Content To Users, Dan Ma
Research Collection School Of Computing and Information Systems
Many websites use Really Simple Syndication (RSS) feeds to actively push their online content to users rather than waiting for users to pull the content passively. In this paper, I construct a theoretical game model to study the profitability of an RSS-PUSH delivery mechanism. The model assumes a general profit structure for websites and heterogeneous users. To access valuable online content, users incur a variety of costs. They choose either to visit the website in the conventional way (the PULL model) or, if it is supported by the website, to use RSS (the PUSH model). Interestingly, I show that although …
A Survey Of Recommender Systems In Twitter, Su Mon Kywe, Ee Peng Lim, Feida Zhu
A Survey Of Recommender Systems In Twitter, Su Mon Kywe, Ee Peng Lim, Feida Zhu
Research Collection School Of Computing and Information Systems
Twitter is a social information network where short messages or tweets are shared among a large number of users through a very simple messaging mechanism. With a population of more than 100M users generating more than 300M tweets each day, Twitter users can be easily overwhelmed by the massive amount of information available and the huge number of people they can interact with. To overcome the above information overload problem, recommender systems can be introduced to help users make the appropriate selection. Researchers have began to study recommendation problems in Twitter but their works usually address individual recommendation tasks. There …
Extracting And Normalizing Entity-Actions From Users' Comments, Swapna Gottipati, Jing Jiang
Extracting And Normalizing Entity-Actions From Users' Comments, Swapna Gottipati, Jing Jiang
Research Collection School Of Computing and Information Systems
With the growing popularity of opinion-rich resources on the Web, new opportunities and challenges arise and aid people in actively using such information to understand the opinions of others. Opinion mining process currently focuses on extracting the sentiments of the users on products, social, political and economical issues. In many instances, users not only express their sentiments but also contribute their ideas, requests and suggestions through comments. Such comments are useful for domain experts and are referred to as actionable content. Extracting actionable knowledge from online social media has attracted a growing interest from both academia and the industry. We …
Reputation As Public Policy For Internet Security: A Field Study, Qian Tang, Leigh L. Linden, John S. Quarterman, Andrew Whinston
Reputation As Public Policy For Internet Security: A Field Study, Qian Tang, Leigh L. Linden, John S. Quarterman, Andrew Whinston
Research Collection School Of Computing and Information Systems
Cybersecurity is a national priority in this big data era. Because of the lack of incentives and the existence of negative externality, companies often underinvest in addressing security risks and accidents, despite government and industry recommendations. In the present article, we propose a method that utilizes reputation through information disclosure to motivate companies to behave pro-socially, improving their Internet security. Using outbound spam as a proxy for Internet security, we conducted a quasiexperimental field study for eight countries through SpamRankings.net. This outgoingspam-based study shows that information disclosure on outgoing spam can help reduce outgoing spam, approximately by 16 percent. This …
Do Hackers Seek Variety? An Empirical Analysis Of Website Defacements, Kok Wei Ooi, Seung-Hyun Kim, Qiu-Hong Wang, Kai Lung Hui
Do Hackers Seek Variety? An Empirical Analysis Of Website Defacements, Kok Wei Ooi, Seung-Hyun Kim, Qiu-Hong Wang, Kai Lung Hui
Research Collection School Of Computing and Information Systems
The importance of securing the cyberspace is higher than ever along with the evolution of cyber attacks launched by hackers with malicious intention. However, there has been little research to understand the hackers who are the most important agents determining the landscape of information security. This paper investigates the behaviors of hackers using a longitudinal dataset of defacement attacks. Based on theories of economics of criminal behaviors and variety seeking, we find that hackers seek variety in choosing their victims in terms of region, hacking method, and the type of operating systems; as their prior experience is focused in terms …
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoffrey J. Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay S. Aravamudhan, Shih-Fen Cheng
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoffrey J. Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay S. Aravamudhan, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Multi-agent planning is a well-studied problem with various applications including disaster rescue, urban transportation and logistics, both for autonomous agents and for decision support to humans. Due to computational constraints, existing research typically focuses on one of two scenarios: unstructured domains with many agents where we are content with heuristic solutions, or domains with small numbers of agents or special structure where we can provide provably near-optimal solutions. By contrast, in this paper, we focus on providing provably near-optimal solutions for domains with large numbers of agents, by exploiting a common domain-general property: if individual agents each have limited influence …
B-Cell Epitope Prediction Through A Graph Model, Liang Zhao, Limsoon Wong, Lanyuan Lu, Steven C. H. Hoi, Jinyan Li
B-Cell Epitope Prediction Through A Graph Model, Liang Zhao, Limsoon Wong, Lanyuan Lu, Steven C. H. Hoi, Jinyan Li
Research Collection School Of Computing and Information Systems
Prediction of B-cell epitopes from antigens is useful to understand the immune basis of antibody-antigen recognition, and is helpful in vaccine design and drug development. Tremendous efforts have been devoted to this long-studied problem, however, existing methods have at least two common limitations. One is that they only favor prediction of those epitopes with protrusive conformations, but show poor performance in dealing with planar epitopes. The other limit is that they predict all of the antigenic residues of an antigen as belonging to one single epitope even when multiple non-overlapping epitopes of an antigen exist.
Structural And Functional Analysis Of Multi-Interface Domains, Liang Zhao, Steven C. H. Hoi, Limsoon Wong, Tobias Hamp, Jinyan Li
Structural And Functional Analysis Of Multi-Interface Domains, Liang Zhao, Steven C. H. Hoi, Limsoon Wong, Tobias Hamp, Jinyan Li
Research Collection School Of Computing and Information Systems
A multi-interface domain is a domain that can shape multiple and distinctive binding sites to contact with many other domains, forming a hub in domain-domain interaction networks. The functions played by the multiple interfaces are usually different, but there is no strict bijection between the functions and interfaces as some subsets of the interfaces play the same function. This work applies graph theory and algorithms to discover fingerprints for the multiple interfaces of a domain and to establish associations between the interfaces and functions, based on a huge set of multi-interface proteins from PDB. We found that about 40% of …
Cost-Sensitive Online Classification, Jialei Wang, Peilin Zhao, Steven C. H. Hoi
Cost-Sensitive Online Classification, Jialei Wang, Peilin Zhao, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Both cost-sensitive classification and online learning have been extensively studied in data mining and machine learning communities, respectively. However, very limited study addresses an important intersecting problem, that is, “Cost-Sensitive Online Classification". In this paper, we formally study this problem, and propose a new framework for Cost-Sensitive Online Classification by directly optimizing cost-sensitive measures using online gradient descent techniques. Specifically, we propose two novel cost-sensitive online classification algorithms, which are designed to directly optimize two well-known cost-sensitive measures: (i) maximization of weighted sum of sensitivity and specificity, and (ii) minimization of weighted misclassification cost. We analyze the theoretical bounds of …
Agent-Based Virtual Humans In Co-Space: An Evaluative Study, Yilin Kang, Ah-Hwee Tan, Fiona Fui-Hoon Nah
Agent-Based Virtual Humans In Co-Space: An Evaluative Study, Yilin Kang, Ah-Hwee Tan, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Co-Space refers to interactive virtual environment modelled after the real world in terms of look-and-feel, functionalities and services. We have developed a 3D virtual world named Nan yang Technological University (NTU) Co-Space populated with virtual human characters. Three key requirements of realistic virtual humans in the virtual world have been identified, namely (1) autonomy: agents can function on their own, (2) interactivity: agents can interact naturally with players, and (3) personality: agents can exhibit human traits and characteristics. Working towards these challenges, we propose a brain-inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personality. We conducted …
Investigating Intelligent Agents In A 3d Virtual World, Yilin Kang, Fiona Fui-Hoon Nah, Ah-Hwee Tan
Investigating Intelligent Agents In A 3d Virtual World, Yilin Kang, Fiona Fui-Hoon Nah, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Web 3.0 involves "intelligent" web applications that utilize natural language processing, machine-based learning and reasoning, and intelligent techniques to analyze and understand user behavior. In this research, we empirically assess a specific form of Web 3.0 application in the form of intelligent agents that offer assistance to users in the virtual world. Using media naturalness theory, we hypothesize that the use of intelligent agents in the virtual world can enhance user experience by offering a more natural way of communication and assistance to users. We are interested to test if media naturalness theory holds in the context of intelligent agents …
Knowledge-Based Exploration For Reinforcement Learning In Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan
Knowledge-Based Exploration For Reinforcement Learning In Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Exploration is necessary during reinforcement learning to discover new solutions in a given problem space. Most reinforcement learning systems, however, adopt a simple strategy, by randomly selecting an action among all the available actions. This paper proposes a novel exploration strategy, known as Knowledge-based Exploration, for guiding the exploration of a family of self-organizing neural networks in reinforcement learning. Specifically, exploration is directed towards unexplored and favorable action choices while steering away from those negative action choices that are likely to fail. This is achieved by using the learned knowledge of the agent to identify prior action choices leading to …
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Shih-Fen Cheng
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Multi-agent planning is a well-studied problem with various applications including disaster rescue, urban transportation and logistics, both for autonomous agents and for decision support to humans. Due to computational constraints, existing research typically focuses on one of two scenarios: unstructured domains with many agents where we are content with heuristic solutions, or domains with small numbers of agents or special structure where we can provide provably near-optimal solutions. By contrast, in this paper, we focus on providing provably near-optimal solutions for domains with large numbers of agents, by exploiting a common domain-general property: if individual agents each have limited influence …
An Extensible Framework For Selecting Incremental Innovations, Arcot Desai Narasimhalu
An Extensible Framework For Selecting Incremental Innovations, Arcot Desai Narasimhalu
Research Collection School Of Computing and Information Systems
There are several innovation methodologies reported in the literature starting from simple concepts such as technology push and market pull all the way to Disruptive innovation. Almost all these methods do not provide for customizability and extensibility. The method described in this paper is called Quick and Dirty Innovation Method or QaDIM in short to represent the fact that the method can be used rather easily to identify incremental innovation opportunities. The paper will first describe the basic concept, and then proceed to give a sample framework before proceeding to describe the extensibility. The method allows firms and individuals to …
Ibinhunt: Binary Hunting With Inter-Procedural Control Flow, Jiang Ming, Meng Pan, Debin Gao
Ibinhunt: Binary Hunting With Inter-Procedural Control Flow, Jiang Ming, Meng Pan, Debin Gao
Research Collection School Of Computing and Information Systems
Techniques have been proposed to find the semantic differences between two binary programs when the source code is not available. Analyzing control flow, and in particular, intra-procedural control flow, has become an attractive technique in the latest binary diffing tools since it is more resistant to syntactic, but non-semantic, differences. However, this makes such techniques vulnerable to simple function obfuscation techniques (e.g., function inlining) attackers any malware writers could use. In this paper, we first show function obfuscation as an attack to such binary diffing techniques, and then propose iBinHunt which uses deep taint and automatic input generation to find …
Detecting Anomalies In Bipartite Graphs With Mutual Dependency Principles, Hanbo Dai, Feida Zhu, Ee Peng Lim, Hwee Hwa Pang
Detecting Anomalies In Bipartite Graphs With Mutual Dependency Principles, Hanbo Dai, Feida Zhu, Ee Peng Lim, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
Bipartite graphs can model many real life applications including users-rating-products in online marketplaces, users-clicking-webpages on the World Wide Web and users referring users in social networks. In these graphs, the anomalousness of nodes in one partite often depends on that of their connected nodes in the other partite. Previous studies have shown that this dependency can be positive (the anomalousness of a node in one partite increases or decreases along with that of its connected nodes in the other partite) or negative (the anomalousness of a node in one partite rises or falls in opposite direction to that of its …
Investigating Intelligent Agents In A 3d Virtual World, Yilin Kang, Fiona Fui-Hoon Nah, Ah-Hwee Tan
Investigating Intelligent Agents In A 3d Virtual World, Yilin Kang, Fiona Fui-Hoon Nah, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Web 3.0 involves " intelligent " web applications that utilize natural language processing, machine-based learning and reasoning, and intelligent techniques to analyze and understand user behavior. In this research, we empirically assess a specific form of Web 3.0 application in the form of intelligent agents that offer assistance to users in the virtual world. Using media naturalness theory, we hypothesize that the use of intelligent agents in the virtual world can enhance user experience by offering a more natural way of communication and assistance to users. We are interested to test if media naturalness theory holds in the context of …
Agent-Based Virtual Humans In Co-Space: An Evaluative Study, Yilin Kang, Ah-Hwee Tan, Fiona Fui-Hoon Nah
Agent-Based Virtual Humans In Co-Space: An Evaluative Study, Yilin Kang, Ah-Hwee Tan, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Co-Space refers to interactive virtual environment modelled after the real world in terms of look-and-feel, functionalities and services. We have developed a 3D virtual world named Nanyang Technological University (NTU) CoSpace populated with virtual human characters. Three key requirements of realistic virtual humans in the virtual world have been identified, namely (1) autonomy: agents can function on their own; (2) interactivity: agents can interact naturally with players; and (3) personality: agents can exhibit human traits and characteristics. Working towards these challenges, we propose a brain-inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personality. We conducted an …