Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (5591)
- Computer Sciences (5576)
- Databases and Information Systems (2329)
- Software Engineering (1250)
- Artificial Intelligence and Robotics (1149)
-
- Numerical Analysis and Scientific Computing (724)
- Engineering (708)
- Information Security (686)
- Graphics and Human Computer Interfaces (581)
- Business (502)
- Social and Behavioral Sciences (501)
- Computer Engineering (349)
- Theory and Algorithms (341)
- Operations Research, Systems Engineering and Industrial Engineering (335)
- Programming Languages and Compilers (241)
- OS and Networks (219)
- Communication (186)
- Public Affairs, Public Policy and Public Administration (184)
- Transportation (167)
- Medicine and Health Sciences (160)
- Education (150)
- Social Media (148)
- Management Information Systems (140)
- E-Commerce (116)
- Data Storage Systems (109)
- Health Information Technology (98)
- International and Area Studies (87)
- Asian Studies (86)
- Digital Communications and Networking (82)
- Higher Education (78)
- Keyword
-
- Deep learning (90)
- Machine learning (88)
- Artificial intelligence (55)
- Reinforcement learning (53)
- Cloud computing (51)
-
- Privacy (49)
- Data mining (47)
- Online learning (44)
- Security (44)
- Social media (43)
- Empirical study (42)
- Optimization (42)
- Training (42)
- Visualization (41)
- Task analysis (39)
- Access control (38)
- Feature extraction (37)
- Neural networks (37)
- Deep Learning (34)
- Software engineering (34)
- Blockchain (33)
- Machine Learning (31)
- Twitter (31)
- Anomaly detection (30)
- Large Language Models (30)
- Privacy-preserving (30)
- Natural language processing (29)
- Singapore (29)
- Clustering (28)
- Collaboration (28)
- Publication Year
Articles 4801 - 4830 of 5707
Full-Text Articles in Entire DC Network
Measuring Method Complexity: Uml Versus Bpmn, Jan Recker, Michael Zur Muehlen, Keng Siau, John Erickson, Marta Indulska
Measuring Method Complexity: Uml Versus Bpmn, Jan Recker, Michael Zur Muehlen, Keng Siau, John Erickson, Marta Indulska
Research Collection School Of Computing and Information Systems
Graphical models are used to depict relevant aspects of real-world domains intended to be supported by an information system. Various approaches for modeling exist and approaches such as object-oriented and process-oriented modeling methods are in widespread use. These modeling methods differ in their expressive power as well as in their complexity of use, thereby leading to an important investment decision for organizations seeking to conduct modeling projects. In this paper, we used an established approach for evaluating the complexity of conceptual modeling methods and compared two important industry standards for modeling, Unified Modeling Language and Business Process Modeling Notation, based …
Multi-Task Transfer Learning For Weakly-Supervised Relation Extraction, Jing Jiang
Multi-Task Transfer Learning For Weakly-Supervised Relation Extraction, Jing Jiang
Research Collection School Of Computing and Information Systems
Creating labeled training data for relation extraction is expensive. In this paper, we study relation extraction in a special weakly-supervised setting when we have only a few seed instances of the target relation type we want to extract but we also have a large amount of labeled instances of other relation types. Observing that different relation types can share certain common structures, we propose to use a multi-task learning method coupled with human guidance to address this weakly-supervised relation extraction problem. The proposed framework models the commonality among different relation types through a shared weight vector, enables knowledge learned from …
Setting Discrete Bid Levels Adaptively In Repeated Auctions, Jilian Zhang, Hoong Chuin Lau, Jialie Shen
Setting Discrete Bid Levels Adaptively In Repeated Auctions, Jilian Zhang, Hoong Chuin Lau, Jialie Shen
Research Collection School Of Computing and Information Systems
The success of an auction design often hinges on its ability to set parameters such as reserve price and bid levels that will maximize an objective function such as the auctioneer revenue. Works on designing adaptive auction mechanisms have emerged recently, and the challenge is in learning different auction parameters by observing the bidding in previous auctions. In this paper, we propose a non-parametric method for determining discrete bid levels dynamically so as to maximize the auctioneer revenue. First, we propose a non-parametric kernel method for estimating the probabilities of closing price with past auction data. Then a greedy strategy …
Multilayer Image Inpainting Approach Based On Neural Networks, Quan Wang, Zhaoxia Wang, Che Sau Chang, Ting Yang
Multilayer Image Inpainting Approach Based On Neural Networks, Quan Wang, Zhaoxia Wang, Che Sau Chang, Ting Yang
Research Collection School Of Computing and Information Systems
This paper describes an image inpainting approach based on the self-organizing map for dividing an image into several layers, assigning each damaged pixel to one layer, and then restoring these damaged pixels by the information of their respective layer. These inpainted layers are then fused together to provide the final inpainting results. This approach takes advantage of the neural network's ability of imitating human's brain to separate objects of an image into different layers for inpainting. The approach is promising as clearly demonstrated by the results in this paper.
Learning And Inferencing In User Ontology For Personalized Semantic Web Search, Xing Jiang, Ah-Hwee Tan
Learning And Inferencing In User Ontology For Personalized Semantic Web Search, Xing Jiang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
User modeling is aimed at capturing the users’ interests in a working domain, which forms the basis of providing personalized information services. In this paper, we present an ontology based user model, called user ontology, for providing personalized information service in the Semantic Web. Different from the existing approaches that only use concepts and taxonomic relations for user modeling, the proposed user ontology model utilizes concepts, taxonomic relations, and non-taxonomic relations in a given domain ontology to capture the users’ interests. As a customized view of the domain ontology, a user ontology provides a richer and more precise representation of …
Verification Of Population Ring Protocols In Pat, Yang Liu, Jun Pang, Jun Sun, Jianhua Zhao
Verification Of Population Ring Protocols In Pat, Yang Liu, Jun Pang, Jun Sun, Jianhua Zhao
Research Collection School Of Computing and Information Systems
The population protocol model has emerged as an elegant paradigm for describing mobile ad hoc networks, consisting of a number of nodes that interact with each other to carry out a computation. One essential property of self-stabilizing population protocols is that all nodes must eventually converge to the correct output value, with respect to all possible initial configurations. It has been shown that fairness constraints play a crucial role in designing population protocols. The Process Analysis Toolkit (PAT) has been developed to perform verifications under different fairness constraints efficiently. In particular, it can handle global fairness, which is required for …
Leak-Free Mediated Group Signatures, Xuhua Ding, Gene Tsudik, Shouhuai Xu
Leak-Free Mediated Group Signatures, Xuhua Ding, Gene Tsudik, Shouhuai Xu
Research Collection School Of Computing and Information Systems
Group signatures are a useful cryptographic construct for privacy-preserving non-repudiable authentication, and there have been many group signature schemes. In this paper, we introduce a variant of group signatures that offers two new security properties called leak-freedom and immediate-revocation. Intuitively, the former ensures that an insider (i.e., an authorized but malicious signer) be unable to convince an outsider (e.g., a signature receiver) that she indeed signed a certain message; whereas the latter ensures that the authorization for a user to issue group signatures can be immediately revoked whenever the need arises (temporarily or permanently). These properties are not offered in …
An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim
An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim
Research Collection School Of Computing and Information Systems
In this paper, an event-centric commodity trading simulation powered by the multiagent framework is presented. The purpose of this simulation platform is for training novice traders. The simulation is progressed by announcing news events that affect various aspects of the commodity supply chain. Upon receiving these events, market agents that play the roles of producers, consumers, and speculators would adjust their views on the market and act accordingly. Their actions would be based on their roles and also their private information, and collectively they shape the market dynamics. This simulation has been effectively deployed for several training sessions. We will …
Compositemap: A Novel Framework For Music Similarity Measure, Bingjun Zhang, Jialie Shen, Qiaoliang Xiang, Ye Wang
Compositemap: A Novel Framework For Music Similarity Measure, Bingjun Zhang, Jialie Shen, Qiaoliang Xiang, Ye Wang
Research Collection School Of Computing and Information Systems
With the continuing advances in data storage and communication technology, there has been an explosive growth of music information from different application domains. As an effective technique for organizing, browsing, and searching large data collections, music information retrieval is attracting more and more attention. How to measure and model the similarity between different music items is one of the most fundamental yet challenging research problems. In this paper, we introduce a novel framework based on a multimodal and adaptive similarity measure for various applications. Distinguished from previous approaches, our system can effectively combine music properties from different aspects into a …
Automatic Steering Of Behavioral Model Inference, David Lo, Leonardo Mariani, Mauro Pezze
Automatic Steering Of Behavioral Model Inference, David Lo, Leonardo Mariani, Mauro Pezze
Research Collection School Of Computing and Information Systems
Many testing and analysis techniques use finite state models to validate and verify the quality of software systems. Since the specification of such models is complex and time-consuming, researchers defined several techniques to extract finite state models from code and traces. Automatically generating models requires much less effort than designing them, and thus eases the verification and validation of large software systems. However, when models are inferred automatically, the precision of the mining process is critical. Behavioral models mined with imprecise processes can include many spurious behaviors, and can thus compromise the results of testing and analysis techniques that use …
Creating Human-Like Autonomous Players In Real-Time First Person Shooter Computer Games, Di Wang, Budhitama Subagdja, Ah-Hwee Tan, Gee-Wah Ng
Creating Human-Like Autonomous Players In Real-Time First Person Shooter Computer Games, Di Wang, Budhitama Subagdja, Ah-Hwee Tan, Gee-Wah Ng
Research Collection School Of Computing and Information Systems
This paper illustrates how we create a software agent by employing FALCON, a self-organizing neural network that performs reinforcement learning, to play a well-known first person shooter computer game known as Unreal Tournament 2004. Through interacting with the game environment and its opponents, our agent learns in real-time without any human intervention. Our agent bot participated in the 2K Bot Prize competition, similar to the Turing test for intelligent agents, wherein human judges were tasked to identify whether their opponents in the game were human players or virtual agents. To perform well in the competition, an agent must act like …
Towards Expressive Specification And Efficient Model Checking, Jin Song Dong, Jun Sun
Towards Expressive Specification And Efficient Model Checking, Jin Song Dong, Jun Sun
Research Collection School Of Computing and Information Systems
System modeling is important and highly non-trivial. The choice of specification language is an important factor in the success of the entire development. The language should cover several facets of the requirements and the model should precisely capture (up to abstraction of irrelevant details) an existing system or a system to be built. The language should have a semantic model suitable to study the behaviors of the system and to establish the validity of desired properties. A formal model can be the basis for a variety of system development activities, e.g., system simulation, visualization, verification or prototype synthesis.
Ktr: An Efficient Key Management Scheme For Secure Data Access Control In Wireless Broadcast Services Recovery, Qijun Gu, Peng Liu, Wang-Chien Lee, Chao-Hsien Chu
Ktr: An Efficient Key Management Scheme For Secure Data Access Control In Wireless Broadcast Services Recovery, Qijun Gu, Peng Liu, Wang-Chien Lee, Chao-Hsien Chu
Research Collection School Of Computing and Information Systems
Wireless broadcast is an effective approach for disseminating data to a number of users. To provide secure access to data in wireless broadcast services, symmetric-key-based encryption is used to ensure that only users who own the valid keys can decrypt the data. With regard to various subscriptions, an efficient key management for distributing and changing keys is in great demand for access control in broadcast services. In this paper, we propose an efficient key management scheme, namely, key tree reuse (KTR), to handle key distribution with regard to complex subscription options and user activities. KTR has the following advantages. First, …
Model Checking Linearizability Via Refinement, Yang Liu, Wei Chen, Yanhong A. Liu, Jun Sun
Model Checking Linearizability Via Refinement, Yang Liu, Wei Chen, Yanhong A. Liu, Jun Sun
Research Collection School Of Computing and Information Systems
Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires checking that 1) all executions of concurrent operations be serializable, and 2) the serialized executions be correct with respect to the sequential semantics. This paper describes a new method to automatically check linearizability based on refinement relations from abstract specifications to concrete implementations. Our method avoids the often difficult task of determining linearization points in implementations, but can also take advantage of linearization points if they are given. The method exploits model checking of finite state systems specified as concurrent …
Information Sharing And Strategic Signaling In Supply Chains, Robert J. Kauffman, Hamid Mohtadi
Information Sharing And Strategic Signaling In Supply Chains, Robert J. Kauffman, Hamid Mohtadi
Research Collection School Of Computing and Information Systems
Information sharing in procurement occurs in rich and varied industry contexts in which managerial decisions are made and organizational strategy is formulated. We explore how information sharing ought to work in procurement contexts that involve investments in inter-organizational information systems (IOS) and collaborative planning, forecasting and replenishment (CPFR) practices. How and under what circumstances does a firm that plays the role of a supply chain buyer decide to share information on key variables, such as point-of-sale consumer demand data with its supplier, up the supply chain? This is a key issue that crosses the boundary between supply chain management and …
Simplenpkl: Simple Non-Parametric Kernel Learning, Jinfeng Zhuang, Ivor Tsang, Steven C. H. Hoi
Simplenpkl: Simple Non-Parametric Kernel Learning, Jinfeng Zhuang, Ivor Tsang, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity of standard interior-point SDP solvers could be as high as O(n6.5). Such intensive computation cost prohibits NPK learning applicable to real applications, even for data sets of moderate size. In this paper, we propose an efficient approach to NPK learning from side information, referred to as SimpleNPKL, which can efficiently learn non-parametric kernels from large sets of pairwise constraints. In particular, we show that the proposed SimpleNPKL with linear loss has a closed-form solution that can …
Nonrigid Shape Recovery By Gaussian Process Regression, Jianke Zhu, Steven C. H. Hoi, Michael R. Liu
Nonrigid Shape Recovery By Gaussian Process Regression, Jianke Zhu, Steven C. H. Hoi, Michael R. Liu
Research Collection School Of Computing and Information Systems
Most state-of-the-art nonrigid shape recovery methods usually use explicit deformable mesh models to regularize surface deformation and constrain the search space. These triangulated mesh models heavily relying on the quadratic regularization term are difficult to accurately capture large deformations, such as severe bending. In this paper, we propose a novel Gaussian process regression approach to the nonrigid shape recovery problem, which does not require to involve a predefined triangulated mesh model. By taking advantage of our novel Gaussian process regression formulation together with a robust coarse-to-fine optimization scheme, the proposed method is fully automatic and is able to handle large …
Architectural Dualities In Complex Systems: Components, Interfaces, Technologies And Organizations, C. Jason Woodard, Joel West
Architectural Dualities In Complex Systems: Components, Interfaces, Technologies And Organizations, C. Jason Woodard, Joel West
Research Collection School Of Computing and Information Systems
Research on technological innovation and product development has long recognized the importance of product architecture, and many scholars have explored its relationship to the organizational structure of the product development process. Product architecture, in turn, has long encompassed both the allocation of functionality to components and the pattern of linkages between them. In this paper, we forge new connections among these established ideas by examining them as two pairs of dual relationships. First, we draw attention to the duality between components and interfaces. While innovation and product development researchers have historically emphasized the partitioning of products and systems into components, …
Non-Redundant Sequential Rules - Theory And Algorithm, David Lo, Siau-Cheng Khoo, Limsoon Wong
Non-Redundant Sequential Rules - Theory And Algorithm, David Lo, Siau-Cheng Khoo, Limsoon Wong
Research Collection School Of Computing and Information Systems
A sequential rule expresses a relationship between two series of events happening one after another. Sequential rules are potentially useful for analyzing data in sequential format, ranging from purchase histories, network logs and program execution traces. In this work, we investigate and propose a syntactic characterization of a non-redundant set of sequential rules built upon past work on compact set of representative patterns. A rule is redundant if it can be inferred from another rule having the same support and confidence. When using the set of mined rules as a composite filter, replacing a full set of rules with a …
Cyber Attacks: Cross-Country Interdependence And Enforcement, Qiu-Hong Wang, Seung Hyun Kim
Cyber Attacks: Cross-Country Interdependence And Enforcement, Qiu-Hong Wang, Seung Hyun Kim
Research Collection School Of Computing and Information Systems
This study empirically characterizes the interdependence in cyber attacks and examines theimpact from the first international treaty against cybercrimes (Convention on Cybercrimes:Europe Treaty Series No. 185). With the data covering 62 countries over the period from year2003 to 2007, we find that, international cooperation in enforcement as measured by theindicator of joining the Convention on Cybercrimes, deterred cyber attacks originating from anyparticular country by 15.81% ~ 24.77% (in 95% confidence interval). Second, joining theConvention also affected the interdependence in cyber attacks from two angels. First, for anypair of country, closer status in joining or not joining the Convention was associated …
Intentional Learning Agent Architecture, Budhitama Subagdja, Liz Sonenberg, Iyad Rahwan
Intentional Learning Agent Architecture, Budhitama Subagdja, Liz Sonenberg, Iyad Rahwan
Research Collection School Of Computing and Information Systems
Dealing with changing situations is a major issue in building agent systems. When the time is limited, knowledge is unreliable, and resources are scarce, the issue becomes more challenging. The BDI (Belief-Desire-Intention) agent architecture provides a model for building agents that addresses that issue. The model can be used to build intentional agents that are able to reason based on explicit mental attitudes, while behaving reactively in changing circumstances. However, despite the reactive and deliberative features, a classical BDI agent is not capable of learning. Plans as recipes that guide the activities of the agent are assumed to be static. …
A Formal Framework For Modeling And Validating Simulink Diagrams, Chunqing Chen, Jin Song Dong, Jun Sun
A Formal Framework For Modeling And Validating Simulink Diagrams, Chunqing Chen, Jin Song Dong, Jun Sun
Research Collection School Of Computing and Information Systems
Simulink has been widely used in industry to model and simulate embedded systems. With the increasing usage of embedded systems in real-time safety-critical situations, Simulink becomes deficient to analyze (timing) requirements with high-level assurance. In this article, we apply Timed Interval Calculus (TIC), a realtime specification language, to complement Simulink with TIC formal verification capability. We elaborately construct TIC library functions to model Simulink library blocks which are used to compose Simulink diagrams. Next, Simulink diagrams are automatically transformed into TIC models which preserve functional and timing aspects. Important requirements such as timing bounded liveness can be precisely specified in …
Sharing Hierarchical Mobile Multimedia Content Using The Mobitop System, Quang Minh Nguyen, Thi Nhu Quynh Kim, Dion Hoe-Lian Goh, Ee-Peng Lim, Yin-Leng Theng, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Khasfariyati Razikin
Sharing Hierarchical Mobile Multimedia Content Using The Mobitop System, Quang Minh Nguyen, Thi Nhu Quynh Kim, Dion Hoe-Lian Goh, Ee-Peng Lim, Yin-Leng Theng, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Khasfariyati Razikin
Research Collection School Of Computing and Information Systems
We introduce MobiTOP (Mobile Tagging of Objects and People), a map-based application which allows users to contribute and share geo-referenced multimedia annotations via mobile devices. An important feature of MobiTOP is that annotations are hierarchical, allowing annotations to be annotated to an arbitrary depth. MobiTOP's interface was designed using a participatory design methodology to ensure that the user interface meets the needs of potential users. In an evaluation, a group of student-teachers involved in a geographical field study were tasked to collaboratively identify rock formations using the MobiTOP system. The students who were in the field were guided by their …
Semisupervised Svm Batch Mode Active Learning With Applications To Image Retrieval, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Michael R. Lyu
Semisupervised Svm Batch Mode Active Learning With Applications To Image Retrieval, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Michael R. Lyu
Research Collection School Of Computing and Information Systems
Active learning has been shown as a key technique for improving content-based image retrieval (CBIR) performance. Among various methods, support vector machine (SVM) active learning is popular for its application to relevance feedback in CBIR. However, the regular SVM active learning has two main drawbacks when used for relevance feedback. First, SVM often suffers from learning with a small number of labeled examples, which is the case in relevance feedback. Second, SVM active learning usually does not take into account the redundancy among examples, and therefore could select multiple examples in relevance feedback that are similar (or even identical) to …
Distributed Constraint Optimization With Structured Resource Constraints, Akshat Kumar, Boi Faltings, Adrian Petcu
Distributed Constraint Optimization With Structured Resource Constraints, Akshat Kumar, Boi Faltings, Adrian Petcu
Research Collection School Of Computing and Information Systems
Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on agents' resource consumption must be taken into account. To address such scenarios, an extension of DCOP-Resource Constrained DCOP - has been proposed. However, certain type of resources have an additional structure associated with them and exploiting it can result in more efficient algorithms than possible with a general framework. An example of these are distribution networks, where the flow of a commodity from sources to sinks is limited by the flow capacity of edges. We present …
A Novel Framework For Efficient Automated Singer Identification In Large Music Databases, Jialie Shen, John Shepherd, Bin Cui, Kian-Lee Tan
A Novel Framework For Efficient Automated Singer Identification In Large Music Databases, Jialie Shen, John Shepherd, Bin Cui, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Over the past decade, there has been explosive growth in the availability of multimedia data, particularly image, video, and music. Because of this, content-based music retrieval has attracted attention from the multimedia database and information retrieval communities. Content-based music retrieval requires us to be able to automatically identify particular characteristics of music data. One such characteristic, useful in a range of applications, is the identification of the singer in a musical piece. Unfortunately, existing approaches to this problem suffer from either low accuracy or poor scalability. In this article, we propose a novel scheme, called Hybrid Singer Identifier (HSI), for …
The Impact Of Process Choice In High Maturity Environments: An Empirical Analysis, Narayanasamy Ramasubbu, Rajesh Krishna Balan
The Impact Of Process Choice In High Maturity Environments: An Empirical Analysis, Narayanasamy Ramasubbu, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
We present the results of a three year field study of the software development process choices made by project teams at two leading offshore vendors. In particular, we focus on the performance implications of project teams that chose to augment structured, plan-driven processes to implement the CMM level-5 Key Process Areas (KPAs) with agile methods. Our analysis of 112 software projects reveals that the decision to augment the firm-recommended, plan-driven approach with improvised, agile methods was significantly affected by the extent of client knowledge and involvement, newness of technology, and the project size. Furthermore this decision had a significant and …
How Tagging Helps Bridge The Gap Between Social And Technical Aspects In Software Development, Christoph Treude, Margaret-Anne Storey
How Tagging Helps Bridge The Gap Between Social And Technical Aspects In Software Development, Christoph Treude, Margaret-Anne Storey
Research Collection School Of Computing and Information Systems
Empirical research on collaborative software development practices indicates that technical and social aspects of software development are often intertwined. The processes followed are tacit and constantly evolving, thus not all of them are amenable to formal tool support. In this paper, we explore how ldquotaggingrdquo, a lightweight social computing mechanism, is used to bridge the gap between technical and social aspects of managing work items. We present the results from an empirical study on how tagging has been adopted and adapted over the past two years of a large project with 175 developers. Our research shows that the tagging mechanism …
An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim, Chao-Chi Liu
An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim, Chao-Chi Liu
Research Collection School Of Computing and Information Systems
In recent years, the study of trading in electronic markets has received significant amount of attention, particularly in the areas of artificial intelligence and electronic commerce. With increasingly sophisticated technologies being applied in analyzing information and making decisions, fully autonomous software agents are expected to take up significant roles in many important fields. This trend is most obvious in the financial domain, where speed of reaction is highly valued and significant investments have been made in information and communication technologies.Despite the successes of automated trading in many important classes of financial markets, commodity trading has lagged behind, mainly because of …
Predicting Outcome For Collaborative Featured Article Nomination In Wikipedia, Meiqun Hu, Ee Peng Lim, Ramayya Krishnan
Predicting Outcome For Collaborative Featured Article Nomination In Wikipedia, Meiqun Hu, Ee Peng Lim, Ramayya Krishnan
Research Collection School Of Computing and Information Systems
In Wikipedia, good articles are wanted. While Wikipedia relies on collaborative effort from online volunteers for quality checking, the process of selecting top quality articles is time consuming. At present, the duty of decision making is shouldered by only a couple of administrators. Aiming to assist in the quality checking cycles so as to cope with the exponential growth of online contributions to Wikipedia, this work studies the task of predicting the outcome of featured article (FA) nominations. We analyze FA candidate (FAC) sessions collected over a period of 3.5 years, and examine the extent to which consensus has been …