Self-Organizing Cognitive Models For Virtual Agents,
2013
Singapore Management University
Self-Organizing Cognitive Models For Virtual Agents, Yilin Kang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Three key requirements of realistic characters or agents in virtual world can be identified as autonomy, interactivity, and personification. Working towards these challenges, this paper proposes a brain inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personification. Based on self-organizing neural models, the agent architecture maintains explicit mental representation of desires, intention, personalities, self-awareness, situation awareness and user awareness. Autonomous behaviors are generated via evaluating the current situation with active goals and learning the most appropriate social or goal-directed rule from the available knowledge, in accordance with the personality of each individual agent. We have built …
Understanding User Resistance To Information Technology: Toward A Comprehensive Model In Health Information Technology,
2013
University of Texas-Pan American
Understanding User Resistance To Information Technology: Toward A Comprehensive Model In Health Information Technology, Madison N. Ngafeeson
Theses and Dissertations - UTB/UTPA
The successful implementation of health information systems is expected to increase legibility, reduce medical errors, boost the quality of healthcare and shrink costs. Yet, evidence points to the fact that healthcare professionals resist the full use of these systems. Physicians and nurses have been reported to resist the system. Even though resistance to technology has always been identified as key issue in the successful implementation of information technology, the subject remains largely under-theorized and deficient of empirical testing. Only two proposed model have been tested so far. Hence, though user resistance is clearly identified and defined in literature, not very …
Cost-Sensitive Online Active Learning With Application To Malicious Url Detection,
2013
Nanyang Technological University
Cost-Sensitive Online Active Learning With Application To Malicious Url Detection, Peilin Zhao, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Malicious Uniform Resource Locator (URL) detection is an important problem in web search and mining, which plays a critical role in internet security. In literature, many existing studies have attempted to formulate the problem as a regular supervised binary classification task, which typically aims to optimize the prediction accuracy. However, in a real-world malicious URL detection task, the ratio between the number of malicious URLs and legitimate URLs is highly imbalanced, making it very inappropriate for simply optimizing the prediction accuracy. Besides, another key limitation of the existing work is to assume a large amount of training data is available, …
Large Scale Online Kernel Classification,
2013
Nanyang Technological University
Large Scale Online Kernel Classification, Jialei Wang, Peilin Zhao, Steven C. H. Hoi, Jinfeng Zhuang, Zhi-Yong Liu
Research Collection School Of Computing and Information Systems
In this work, we present a new framework for large scale online kernel classification, making kernel methods efficient and scalable for large-scale online learning tasks. Unlike the regular budget kernel online learning scheme that usually uses different strategies to bound the number of support vectors, our framework explores a functional approximation approach to approximating a kernel function/matrix in order to make the subsequent online learning task efficient and scalable. Specifically, we present two different online kernel machine learning algorithms: (i) the Fourier Online Gradient Descent (FOGD) algorithm that applies the random Fourier features for approximating kernel functions; and (ii) the …
Delayflow Centrality For Identifying Critical Nodes In Transportation Networks,
2013
Singapore Management University
Delayflow Centrality For Identifying Critical Nodes In Transportation Networks, Yew-Yih Cheng, Roy Ka Wei Lee, Ee-Peng Lim, Feida Zhu
Research Collection School Of Computing and Information Systems
In an urban city, its transportation network supports efficient flow of people between different parts of the city. Failures in the network can cause major disruptions to commuter and business activities which can result in both significant economic and time losses. In this paper, we investigate the use of centrality measures to determine critical nodes in a transportation network so as to improve the design of the network as well as to devise plans for coping with network failures. Most centrality measures in social network analysis research unfortunately consider only topological structure of the network and are oblivious of transportation …
An Empirical Analysis Of A Network Of Expertise,
2013
Singapore Management University
An Empirical Analysis Of A Network Of Expertise, Le Truc Viet, Minh Thap Nguyen
Research Collection School Of Computing and Information Systems
In this paper, we analyze the network of expertise constructed from the interactions of users on the online questionanswering (QA) community of Stack Overflow. This community was built with the intention of helping users with their programming tasks and, thus, questions are expected to be highly factual. This also indicates that the answers one provides may be highly indicative of one's level of expertise on the subject matter. Therefore, our main concern is how to model and characterize the user's expertise based on the constructed network and its centrality measures. We used the user's reputation established on Stack Overflow as …
Computing Immutable Regions For Subspace Top-K Queries,
2013
Singapore Management University
Computing Immutable Regions For Subspace Top-K Queries, Kyriakos Mouratidis, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
Given a high-dimensional dataset, a top-k query can be used to shortlist the k tuples that best match the user’s preferences. Typically, these preferences regard a subset of the available dimensions (i.e., attributes) whose relative significance is expressed by user-specified weights. Along with the query result, we propose to compute for each involved dimension the maximal deviation to the corresponding weight for which the query result remains valid. The derived weight ranges, called immutable regions, are useful for performing sensitivity analysis, for finetuning the query weights, etc. In this paper, we focus on top-k queries with linear preference functions over …
Politics, Sharing And Emotion In Microblogs,
2013
Singapore Management University
Politics, Sharing And Emotion In Microblogs, Tuan-Anh Hoang, William Cohen, Ee Peng Lim, Doug Pierce, David Redlawsk
Research Collection School Of Computing and Information Systems
In political contexts, it is known that people act as "motivated reasoners", i.e., information is evaluated first for emotional affect, and this emotional reaction influences later deliberative reasoning steps. As social media becomes a more and more prevalent way of receiving political information, it becomes important to understand more completely the interaction between information, emotion, social community, and information-sharing behavior. In this paper, we describe a high-precision classifier for politically-oriented tweets, and an accurate classifier of a Twitter user's political affiliation. Coupled with existing sentiment-analysis tools for microblogs, these methods enable us to systematically study the interaction of emotion and …
Vigilance Adaptation In Adaptive Resonance Theory,
2013
Singapore Management University
Vigilance Adaptation In Adaptive Resonance Theory, Lei Meng, Ah-Hwee Tan, Donald C. Winsch
Research Collection School Of Computing and Information Systems
Despite the advantages of fast and stable learning, Adaptive Resonance Theory (ART) still relies on an empirically fixed vigilance parameter value to determine the vigilance regions of all of the clusters in the category field (F 2 ), causing its performance to depend on the vigilance value. It would be desirable to use different values of vigilance for different category field nodes, in order to fit the data with a smaller number of categories. We therefore introduce two methods, the Activation Maximization Rule (AMR) and the Confliction Minimization Rule (CMR). Despite their differences, both ART with AMR (AM-ART) and with …
Student Interaction With Content In Online And Hybrid Courses: Leading Horses To The Proverbial Water,
2013
Kennsaw State University
Student Interaction With Content In Online And Hybrid Courses: Leading Horses To The Proverbial Water, Meg Murray, Jorge Perez, Debra Geist, Alison Hedrick
Faculty Articles
Permutations of traditional and online learning are rapidly advancing along a blended continuum, prompting conjecture that learning and e-learning will soon be indistinguishable. As variations of blended learning evolve, educators worldwide must develop better understanding of how effective interaction with course content impacts engagement and learning. This study compares patterns of access to instructional content in online and hybrid courses offered at a regional university in the United States. Frequency counts and access rates were examined for course content in four categories: core materials, direct support, indirect support, and ancillary materials. Observed results were echoed in responses to a survey …
Filestream Enhancement To The Courseweb Grading System,
2013
Governors State University
Filestream Enhancement To The Courseweb Grading System, Derrick Massey
All Capstone Projects
Data is sometimes unstructured, such as text documents, images, and videos. This unstructured data is regularly stored outside the database, different from its structured data. This separation can cause data management problems. Or, if the data is connected with regulated storage, the performance and the file streaming capabilities and can degrade.
FILESTREAM incorporates the SQL Server Database Engine with an NTFS file system by loading varbinary(max) BLOB data as files. And make them available to the file system. Transact-SQL statements can update, query, search, insert, and or back up FILESTREAM data. The Win32 file system interface affords streaming access to …
Mining Direct Antagonistic Communities In Signed Social Networks,
2013
Singapore Management University
Mining Direct Antagonistic Communities In Signed Social Networks, David Lo, Didi Surian, Philips Kokoh Prasetyo, Zhang Kuan, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Social networks provide a wealth of data to study relationship dynamics among people. Most social networks such as Epinions and Facebook allow users to declare trusts or friendships with other users. Some of them also allow users to declare distrusts or negative relationships. When both positive and negative links co-exist in a network, some interesting community structures can be studied. In this work, we mine Direct Antagonistic Communities (DACs) within such signed networks. Each DAC consists of two sub-communities with positive relationships among members of each sub-community, and negative relationships among members of the other sub-community. Identifying direct antagonistic communities …
From Questions To Effective Answers: On The Utility Of Knowledge-Driven Querying Systems For Life Sciences Data,
2013
Wright State University - Main Campus
From Questions To Effective Answers: On The Utility Of Knowledge-Driven Querying Systems For Life Sciences Data, Amir H. Asiaee, Prashant Doshi, Todd Minning, Satya S. Sahoo, Priti Parikh, Amit P. Sheth, Rick L. Tarleton
Kno.e.sis Publications
We compare two distinct approaches for querying data in the context of the life sciences. The first approach utilizes conventional databases to store the data and provides intuitive form-based interfaces to facilitate querying of the data, commonly used by the life science researchers that we study. The second approach utilizes a large OWL ontology and the same datasets associated as RDF instances of the ontology. Both approaches are being used in parallel by a team of cell biologists in their daily research activities, with the objective of gradually replacing the conventional approach with the knowledge-driven one. We describe several benefits …
The Impact Of Technical Innovation On Voter Registration And Turnout,
2013
Dakota State University
The Impact Of Technical Innovation On Voter Registration And Turnout, Chere' Evans
Masters Theses & Doctoral Dissertations
Research on provisional ballots is nearly nonexistent and research on military and overseas civilian absentee ballots is limited. While the percentages of those voters are small, they are still substantial enough to swing close elections, so ensuring that every eligible voter has his or her vote counted is essential and research is needed in order to identify ways to improve processes for these voters.
By the 2012 Presidential General election, the Maryland State Board of Elections (SBE) had implemented Online Voter Registration (OLVR), Electronic (or paperless) Motor Voter (EMV), and Online Absentee Request (OAR). Maryland also did a redesign of …
Mkboost: A Framework Of Multiple Kernel Boosting,
2013
Nanyang Technological University
Mkboost: A Framework Of Multiple Kernel Boosting, Hao Xia, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Multiple kernel learning (MKL) is a promising family of machine learning algorithms using multiple kernel functions for various challenging data mining tasks. Conventional MKL methods often formulate the problem as an optimization task of learning the optimal combinations of both kernels and classifiers, which usually results in some forms of challenging optimization tasks that are often difficult to be solved. Different from the existing MKL methods, in this paper, we investigate a boosting framework of MKL for classification tasks, i.e., we adopt boosting to solve a variant of MKL problem, which avoids solving the complicated optimization tasks. Specifically, we present …
Video Concept Detection By Learning From Web Images: A Case Study On Cross Domain Learning,
2013
Singapore Management University
Video Concept Detection By Learning From Web Images: A Case Study On Cross Domain Learning, Shiai Zhu, Ting Yao, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Concept detection is probably the most important research problem in the area of multimedia. The need to model with sufficient and diverse training instances, however, makes the task computationally and resourcefully expensive. Meanwhile, the popularity of social media has generated massive amount of weakly tagged images which could be leveraged for concept model learning. Therefore, in this paper, we consider exploring weakly taggedWeb images to shed some light on video concept detection. Particularly, two sets of Web images downloaded from Flickr are utilized as training data for concept detection on two real-world large-scale video datasets released by TRECVID. Our experiments …
Unified Modeling Language: The Teen Years And Growing Pains,
2013
Singapore Management University
Unified Modeling Language: The Teen Years And Growing Pains, J. Erickson, Keng Siau
Research Collection School Of Computing and Information Systems
Unified Modeling Language (UML) is adopted by the Object Management Group as a standardized general-purpose modeling language for object-oriented software engineering. Despite its status as a standard, UML is still in a development stage and many studies have highlighted its weaknesses and challenges - including those related to human factor issues. Further, UML has grown considerably more complex since its inception. This paper traces the history of Unified Modeling Language (UML) from its formation to its current state and discusses the current state of the UML language. The paper first introduces UML and its various diagrams, and discusses its characteristics …
Shortlisting Top-K Assignments,
2013
Singapore Management University
Shortlisting Top-K Assignments, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
In this paper we identify a novel query type, the top-K assignment query (αTop-K). Consider a set of objects and a set of suppliers, where each object must be assigned to one supplier. Assume that there is a cost associated with every object-supplier pair. If we allocate each object to the server with the smallest cost (for the specific object), the derived overall assignment will have the minimum total cost. In many scenarios, however, runner-up assignments may be required too, like for example when a decision maker needs to make additional considerations, not captured by individual object-supplier costs. In this …
Active Learning With Expert Advice,
2013
Nanyang Technological University
Active Learning With Expert Advice, Peilin Zhao, Steven C. H. Hoi, Jinfeng Zhuang
Research Collection School Of Computing and Information Systems
Conventional learning with expert advice methods assumes a learner is always receiving the outcome (e.g., class labels) of every incoming training instance at the end of each trial. In real applications, acquiring the outcome from oracle can be costly or time consuming. In this paper, we address a new problem of active learning with expert advice, where the outcome of an instance is disclosed only when it is requested by the online learner. Our goal is to learn an accurate prediction model by asking the oracle the number of questions as small as possible. To address this challenge, we propose …
Reviving Dormant Ties In An Online Social Network Experiment,
2013
Singapore Management University
Reviving Dormant Ties In An Online Social Network Experiment, Ee Peng Lim, Denzil Correa, David Lo, Michael Finegold, Feida Zhu
Research Collection School Of Computing and Information Systems
Social network users connect and interact with one another to fulfil different kinds of social and information needs. When interaction ceases between two users, we say that their tie becomes dormant. While there are different underlying reasons of dormant ties, it is important to find means to revive such ties so as to maintain vibrancy in the relationships. In this work, we thus focus on designing an online experiment to evaluate the effectiveness of personalized social messages to revive dormant ties. The experiment carefully selects users with dormant ties so that no user gets mixed treatments and be affected by …
