Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3880)
- Singapore Management University (1060)
- University of Nebraska - Lincoln (747)
- Missouri University of Science and Technology (104)
- Old Dominion University (51)
-
- University of Arkansas, Fayetteville (48)
- University of Dayton (36)
- California Polytechnic State University, San Luis Obispo (33)
- Chapman University (28)
- City University of New York (CUNY) (28)
- Purdue University (25)
- Embry-Riddle Aeronautical University (24)
- Illinois State University (23)
- University of Kentucky (23)
- Central Bank of Nigeria (21)
- Southern Methodist University (20)
- Technological University Dublin (19)
- University of New Mexico (16)
- University of Montana (15)
- University of Nebraska at Omaha (15)
- Air Force Institute of Technology (13)
- Kennesaw State University (13)
- Claremont Colleges (12)
- LSU New Orleans (12)
- University of Nevada, Las Vegas (12)
- Virginia Commonwealth University (11)
- Central Washington University (10)
- Columbus State University (10)
- Loyola University Chicago (10)
- Edith Cowan University (9)
- Keyword
-
- Simulation (162)
- Deep learning (76)
- Path planning (76)
- Machine learning (75)
- Genetic algorithm (51)
-
- Data mining (47)
- Numerical simulation (47)
- Reinforcement learning (47)
- Modeling (46)
- Machine Learning (44)
- Virtual reality (44)
- Digital twin (43)
- Multi-objective optimization (42)
- Modeling and simulation (39)
- Particle swarm optimization (37)
- Optimization (35)
- Visualization (35)
- Social media (34)
- Deep reinforcement learning (30)
- Attention mechanism (29)
- Fault diagnosis (29)
- Neural network (29)
- Twitter (28)
- Feature extraction (27)
- UAV (27)
- Classification (26)
- Clustering (26)
- Neural networks (25)
- Simulation model (25)
- Artificial intelligence (24)
- Publication Year
- Publication
-
- Journal of System Simulation (3880)
- Research Collection School Of Computing and Information Systems (1024)
- The R Journal (708)
- Computer Science Faculty Publications (52)
- Physics Faculty Research & Creative Works (44)
-
- Theses and Dissertations (41)
- CBN Journal of Applied Statistics (JAS) (21)
- Annual Symposium on Biomathematics and Ecology Education and Research (20)
- Geosciences and Geological and Petroleum Engineering Faculty Research & Creative Works (19)
- Graduate Theses and Dissertations (19)
- Dissertations (15)
- Dissertations and Theses Collection (Open Access) (15)
- Electronic Theses and Dissertations (15)
- Graduate Student Theses, Dissertations, & Professional Papers (15)
- Chemistry Faculty Research & Creative Works (14)
- Computer Science and Computer Engineering Undergraduate Honors Theses (14)
- Master's Theses (14)
- The Summer Undergraduate Research Fellowship (SURF) Symposium (14)
- Doctoral Dissertations and Master's Theses (12)
- LSU New Orleans Theses and Dissertations (12)
- Dissertations, Theses, and Capstone Projects (11)
- Electrical & Computer Engineering Theses & Dissertations (11)
- Holland Computing Center: Faculty Publications (10)
- SMU Data Science Review (10)
- Computer Science Theses & Dissertations (9)
- Computer Science: Faculty Publications and Other Works (9)
- Interdisciplinary Informatics Faculty Proceedings & Presentations (9)
- Publications and Research (9)
- STAR Program Research Presentations (9)
- Williams Honors College, Honors Research Projects (9)
- Publication Type
- File Type
Articles 6211 - 6240 of 6663
Full-Text Articles in Computer Sciences
Mining Collaboration Patterns From A Large Developer Network, Didi Surian, David Lo, Ee Peng Lim
Mining Collaboration Patterns From A Large Developer Network, Didi Surian, David Lo, Ee Peng Lim
Research Collection School Of Computing and Information Systems
In this study, we extract patterns from a large developer collaborations network extracted from Source Forge. Net at high and low level of details. At the high level of details, we extract various network-level statistics from the network. At the low level of details, we extract topological sub-graph patterns that are frequently seen among collaborating developers. Extracting sub graph patterns from large graphs is a hard NP-complete problem. To address this challenge, we employ a novel combination of graph mining and graph matching by leveraging network-level properties of a developer network. With the approach, we successfully analyze a snapshot of …
A Biologically-Inspired Cognitive Agent Model Integrating Declarative Knowledge And Reinforcement Learning, Ah-Hwee Tan, Gee-Wah Ng
A Biologically-Inspired Cognitive Agent Model Integrating Declarative Knowledge And Reinforcement Learning, Ah-Hwee Tan, Gee-Wah Ng
Research Collection School Of Computing and Information Systems
The paper proposes a biologically-inspired cognitive agent model, known as FALCON-X, based on an integration of the Adaptive Control of Thought (ACT-R) architecture and a class of self-organizing neural networks called fusion Adaptive Resonance Theory (fusion ART). By replacing the production system of ACT-R by a fusion ART model, FALCON-X integrates high-level deliberative cognitive behaviors and real-time learning abilities, based on biologically plausible neural pathways. We illustrate how FALCON-X, consisting of a core inference area interacting with the associated intentional, declarative, perceptual, motor and critic memory modules, can be used to build virtual robots for battles in a simulated RoboCode …
Shortest Path Computation On Air Indexes, Georgios Kellaris, Kyriakos Mouratidis
Shortest Path Computation On Air Indexes, Georgios Kellaris, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Shortest path computation is one of the most common queries in location-based services that involve transportation net- works. Motivated by scalability challenges faced in the mo- bile network industry, we propose adopting the wireless broad- cast model for such location-dependent applications. In this model the data are continuously transmitted on the air, while clients listen to the broadcast and process their queries locally. Although spatial problems have been considered in this environment, there exists no study on shortest path queries in road networks. We develop the rst framework to compute shortest paths on the air, and demonstrate the practicality and …
Team Performance Prediction In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava
Team Performance Prediction In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
In this study, we propose a comprehensive performance management tool for measuring and reporting operational activities of teams. This study uses performance data of game players and teams in EverQuest II, a popular MMORPG developed by Sony Online Entertainment, to build performance prediction models for task performing teams. The prediction models provide a projection of task performing team's future performance based on the past performance patterns of participating players on the team as well as team characteristics. While the existing game system lacks the ability to predict team-level performance, the prediction models proposed in this study are expected to be …
Mining Interaction Behaviors For Email Reply Order Prediction, Byung-Won On, Ee Peng Lim, Jing Jiang, Amruta Purandare, Loo Nin Teow
Mining Interaction Behaviors For Email Reply Order Prediction, Byung-Won On, Ee Peng Lim, Jing Jiang, Amruta Purandare, 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 …
On Decision Support For Deliberating With Constraints In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau, David H. Wood
On Decision Support For Deliberating With Constraints In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau, David H. Wood
Research Collection School Of Computing and Information Systems
This paper introduces the Deliberation Decision Support System (DDSS). The DDSS obtains heuristically (using a genetic algorithm) solutions of interest for constrained optimization models. This is illustrated, without loss of generality, by generalized assignment problems. The DDSS also provides users with graphical tools that support post-solution deliberation for constrained optimization models. The DDSS and this paper, as befits practical concerns, are focused on deliberation with respect to the constraints of the models being used.
A Probabilistic Approach To Personalized Tag Recommendation, Meiqun Hu, Ee Peng Lim, Jing Jiang
A Probabilistic Approach To Personalized Tag Recommendation, Meiqun Hu, Ee Peng Lim, Jing Jiang
Research Collection School Of Computing and Information Systems
In this work, we study the task of personalized tag recommendation in social tagging systems. To reach out to tags beyond the existing vocabularies of the query resource and of the query user, we examine recommendation methods that are based on personomy translation, and propose a probabilistic framework for incorporating translations by similar users (neighbors). We propose to use distributional divergence to measure the similarity between users in the context of personomy translation, and examine two variations of such similarity measures. We evaluate the proposed framework on a benchmark dataset collected from BibSonomy, and compare with personomy translation methods based …
Messaging Behavior Modeling In Mobile Social Networks, Byung-Won On, Ee Peng Lim, Jing Jiang, Freddy Tat Chua Chua, Viet-An Nguyen, Loo Nin Teow
Messaging Behavior Modeling In Mobile Social Networks, Byung-Won On, Ee Peng Lim, Jing Jiang, Freddy Tat Chua Chua, Viet-An Nguyen, Loo Nin Teow
Research Collection School Of Computing and Information Systems
Mobile social networks are gaining popularity with the pervasive use of mobile phones and other handheld devices. In these networks, users maintain friendship links, exchange short messages and share content with one another. In this paper, we study the user behaviors in mobile messaging and friendship linking using the data collected from a large mobile social network service known as myGamma (m.mygamma.com). We distinguish two types of user behaviors: soliciting active responses for an initiated message and responding to an incoming message. We propose various models for the two behaviors also known as engagingness and responsiveness. Our experiments show that …
Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau
Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper introduces the SoI problem, that of finding nonoptimal solutions of interest for constrained optimization models. SoI problems subsume finding FoIs (feasible solutions of interest), and IoIs (infeasible solutions of interest). In all cases, the interest addressed is post-solution analysis in one form or another. Post-solution analysis of a constrained optimization model occurs after the model has been solved and a good or optimal solution for it has been found. At this point, sensitivity analysis and other questions of import for decision making (discussed in the paper) come into play and for this purpose the SoIs can be of …
Generating Templates Of Entity Summaries With An Entity-Aspect Model And Pattern Mining, Peng Li, Jing Jiang, Yinglin Wang
Generating Templates Of Entity Summaries With An Entity-Aspect Model And Pattern Mining, Peng Li, Jing Jiang, Yinglin Wang
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel approach to automatic generation of summary templates from given collections of summary articles. This kind of summary templates can be useful in various applications. We first develop an entity-aspect LDA model to simultaneously cluster both sentences and words into aspects. We then apply frequent subtree pattern mining on the dependency parse trees of the clustered and labeled sentences to discover sentence patterns that well represent the aspects. Key features of our method include automatic grouping of semantically related sentence patterns and automatic identification of template slots that need to be filled in. We …
Extracting Common Emotions From Blogs Based On Fine-Grained Sentiment Clustering, Shi Feng, Daling Wang, Ge Yu, Wei Gao, Kam-Fai Wong
Extracting Common Emotions From Blogs Based On Fine-Grained Sentiment Clustering, Shi Feng, Daling Wang, Ge Yu, Wei Gao, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
Recently, blogs have emerged as the major platform for people to express their feelings and sentiments in the age of Web 2.0. The common emotions, which reflect people’s collective and overall sentiments, are becoming the major concern for governments, business companies and individual users. Different from previous literatures on sentiment classification and summarization, the major issue of common emotion extraction is to find out people’s collective sentiments and their corresponding distributions on the Web. Most existing blog clustering methods take into account keywords, stories or timelines but neglect the embedded sentiments, which are considered very important features of blogs. In …
Hybrid Time-Frequency Domain Analysis For Inverter-Fed Induction Motor Fault Detection, T. W. Chua, W. W. Tan, Zhaoxia Wang, C. S. Chang
Hybrid Time-Frequency Domain Analysis For Inverter-Fed Induction Motor Fault Detection, T. W. Chua, W. W. Tan, Zhaoxia Wang, C. S. Chang
Research Collection School Of Computing and Information Systems
The detection of faults in an induction motor is important as a part of preventive maintenance. Stator current is one of the most popular signals used for utility-supplied induction motor fault detection as a current sensor can be installed nonintrusively. In variable speeds operation, the use of an inverter to drive the induction motor introduces noise into the stator current so stator current based fault detection techniques become less reliable. This paper presents a hybrid algorithm, which combines time and frequency domain analysis, for broken rotor bar and bearing fault detection. Cluster information obtained by using Independent Component Analysis (ICA) …
Show Me The Numbers: Visual Analytics For Insights, Tin Seong Kam
Show Me The Numbers: Visual Analytics For Insights, Tin Seong Kam
Research Collection School Of Computing and Information Systems
In this highly volatile and fast-paced financial market, traders and managers working in banking and financial organizations must struggle to cope with large and complex data from multi-sources, that move throughout the market at increasingly high speed. The cost of making poor business and investment decisions is very high. This places great demands on data analysts, who are responsible for providing process information, to support the activities of traders and managers. Static reports and traditional business intelligence tools simply cannot keep up with a market that is changing on a second-to-second basis. By the time the traders and bankers have …
Effective Music Tagging Through Advanced Statistical Modeling, Jialie Shen, Meng Wang, Shuicheng Yan, Hwee Hwa Pang, Xian-Sheng Hua
Effective Music Tagging Through Advanced Statistical Modeling, Jialie Shen, Meng Wang, Shuicheng Yan, Hwee Hwa Pang, Xian-Sheng Hua
Research Collection School Of Computing and Information Systems
Music information retrieval (MIR) holds great promise as a technology for managing large music archives. One of the key components of MIR that has been actively researched into is music tagging. While significant progress has been achieved, most of the existing systems still adopt a simple classification approach, and apply machine learning classifiers directly on low level acoustic features. Consequently, they suffer the shortcomings of (1) poor accuracy, (2) lack of comprehensive evaluation results and the associated analysis based on large scale datasets, and (3) incomplete content representation, arising from the lack of multimodal and temporal information integration. In this …
Hybrid Time-Frequency Domain Analysis For Inverter-Fed Induction Motor Fault Detection, T. W. Chua, W. W. Tan, Zhaoxia Wang, C. S. Chang
Hybrid Time-Frequency Domain Analysis For Inverter-Fed Induction Motor Fault Detection, T. W. Chua, W. W. Tan, Zhaoxia Wang, C. S. Chang
Research Collection School Of Computing and Information Systems
The detection of faults in an induction motor is important as a part of preventive maintenance. Stator current is one of the most popular signals used for utility-supplied induction motor fault detection as a current sensor can be installed nonintrusively. In variable speeds operation, the use of an inverter to drive the induction motor introduces noise into the stator current so stator current based fault detection techniques become less reliable. This paper presents a hybrid algorithm, which combines time and frequency domain analysis, for broken rotor bar and bearing fault detection. Cluster information obtained by using Independent Component Analysis (ICA) …
Impact Of Flow And Brand Equity In 3d Virtual Worlds, Fiona Fui-Hoon Nah, Brenda Eschenbrenner, David Dewester, So Ra Park
Impact Of Flow And Brand Equity In 3d Virtual Worlds, Fiona Fui-Hoon Nah, Brenda Eschenbrenner, David Dewester, So Ra Park
Research Collection School Of Computing and Information Systems
This research is a partial test of Park et al.’s (2008) model to assess the impact of flow and brand equity in 3D virtual worlds. It draws on flow theory as its main theoretical foundation to understand and empirically assess the impact of flow on brand equity and behavioral intention in 3D virtual worlds. The findings suggest that the balance of skills and challenges in 3D virtual worlds influences users’ flow experience, which in turn influences brand equity. Brand equity then increases behavioral intention. The authors also found that the impact of flow on behavioral intention in 3D virtual worlds …
The R Journal (June 2010) 2(1): Complete Issue, The R Foundation
The R Journal (June 2010) 2(1): Complete Issue, The R Foundation
The R Journal
Contributed Research Articles
IsoGene: An R Package for Analyzing Dose-response Studies in Microarray Experiments, Setia Pramana, Dan Lin, Philippe Haldermans, Ziv Shkedy, Tobias Verbeke, Hinrich Göhlmann, An De Bondt, Willem Talloen, and Luc Bijnens
MCMC for Generalized Linear Mixed Models with glmmBUGS, Patrick Brown and Lutong Zhou
Mapping and Measuring Country Shapes, Nils B. Weidmann and Kristian Skrede Gleditsch
tmvtnorm: A Package for the Truncated Multivariate Normal Distribution, Stefan Wilhelm and B. G. Manjunath
neuralnet: Training of Neural Networks, Frauke Günther and Stefan Fritsch
glmperm: A Permutation of Regressor Residuals Test for Inference in Generalized Linear Models, Wiebke Werft and …
Isogene: An R Package For Analyzing Dose-Response Studies In Microarray Experiments, Setia Pramana, Dan Lin, Philippe Haldermans, Ziv Shkedy, Tobias Verbeke, Hinrich Göhlmann, An De Bondt, Williem Talloen, Luc Bijnens
Isogene: An R Package For Analyzing Dose-Response Studies In Microarray Experiments, Setia Pramana, Dan Lin, Philippe Haldermans, Ziv Shkedy, Tobias Verbeke, Hinrich Göhlmann, An De Bondt, Williem Talloen, Luc Bijnens
The R Journal
IsoGene is an R package for the analysis of dose-response microarray experiments to identify gene or subsets of genes with a mono tone relationship between the gene expression and the doses. Several testing procedures (i.e., the likelihood ratio test, Williams, Marcus, the M, and Modified M), that take into account the order restriction of the means with respect to the increasing doses are implemented in the package. The inference is based on resampling methods, both permutations and the Significance Analysis of Microarrays (SAM).
Two-Sided Exact Tests And Matching Confidence Intervals For Discrete Data, Michael P. Fay
Two-Sided Exact Tests And Matching Confidence Intervals For Discrete Data, Michael P. Fay
The R Journal
There is an inherent relationship between two-sided hypothesis tests and confidence intervals. A series of two-sided hypothesis tests may be inverted to obtain the matching 100(1-)% confidence interval defined as the smallest interval that contains all point null parameter values that would not be rejected at the α level. Unfortunately, for discrete data there are several different ways of defining two-sided exact tests and the most commonly used two sided exact tests are defined one way, while the most commonly used exact confidence intervals are inversions of tests defined another way. This can lead to inconsistencies where the exact test …
Neuralnet: Training Of Neural Networks, Franke Günther, Stefan Fritsch
Neuralnet: Training Of Neural Networks, Franke Günther, Stefan Fritsch
The R Journal
Artificial neural networks are applied in many situations. neuralnet is built to train multi-layer perceptrons in the context of regression analyses, i.e. to approximate functional relationships between covariates and response variables. Thus, neural networks are used as extensions of generalized linear models. neuralnet is a very flexible package. The back propagation algorithm and three versions of resilient back-propagation are implemented and it provides a custom-choice of activation and error function. An arbitrary number of covariates and response variables as well as of hidden layers can theoretically be included. The paper gives a brief introduction to multi-layer perceptrons and resilient back-propagation …
Mcmc For Generalized Linear Mixed Models With Glmmbugs, Patrick Brown, Lutong Zhou
Mcmc For Generalized Linear Mixed Models With Glmmbugs, Patrick Brown, Lutong Zhou
The R Journal
The glmmBUGS package is a bridging tool between Generalized Linear Mixed Models (GLMMs) in R and the BUGS language. It provides a simple way of performing Bayesian inference using Markov Chain Monte Carlo (MCMC) methods, taking a model formula and data frame in R and writing a BUGS model file, data file, and initial values files. Functions are provided to reformat and summarize the BUGS results. A key aim of the package is to provide files and objects that can be modified prior to calling BUGS, giving users a platform for customizing and extending the models to accommodate a wide …
Glmperm: A Permutation Of Regressor Residuals Test For Inference In Generalized Linear Models, Wiebke Werft, Axel Benner
Glmperm: A Permutation Of Regressor Residuals Test For Inference In Generalized Linear Models, Wiebke Werft, Axel Benner
The R Journal
We introduce a new R package called glmperm for inference in generalized linear models especially for small and moderate-sized data sets. The inference is based on the per mutation of regressor residuals test introduced by Potter (2005). The implementation of glmperm outperforms currently available permutation test software as glmperm can be applied in situations where more than one covariate is involved.
Tmvtnorm: A Package For The Truncated Multivariate Normal Distribution, Stefan Wilhelm, B. G. Manjunath
Tmvtnorm: A Package For The Truncated Multivariate Normal Distribution, Stefan Wilhelm, B. G. Manjunath
The R Journal
In this article we present tmvtnorm, an R package implementation for the truncated multivariate normal distribution. We consider random number generation with rejection and Gibbs sampling, computation of marginal densities as well as computation of the mean and co variance of the truncated variables. This contribution brings together latest research in this field and provides useful methods for both scholars and practitioners when working with truncated normal variables.
Prediction Of Protein Subcellular Localization: A Machine Learning Approach, Kyong Jin Shim
Prediction Of Protein Subcellular Localization: A Machine Learning Approach, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
Subcellular localization is a key functional characteristic of proteins. Optimally combining available information is one of the key challenges in today's knowledge-based subcellular localization prediction approaches. This study explores machine learning approaches for the prediction of protein subcellular localization that use resources concerning Gene Ontology and secondary structures. Using the spectrum kernel for feature representation of amino acid sequences and secondary structures, we explore an SVM-based learning method that classifies six subcellular localization sites: endoplasmic reticulum, extracellular, Golgi, membrane, mitochondria, and nucleus.
Convergence Of The Sinc Method Applied To Volterra Integral Equations, M. Zarebnia, J. Rashidinia
Convergence Of The Sinc Method Applied To Volterra Integral Equations, M. Zarebnia, J. Rashidinia
Applications and Applied Mathematics: An International Journal (AAM)
A collocation procedure is developed for the linear and nonlinear Volterra integral equations, using the globally defined Sinc and auxiliary basis functions. We analytically show the exponential convergence of the Sinc collocation method for approximate solution of Volterra integral equations. Numerical examples are included to confirm applicability and justify rapid convergence of our method.
Using Hadoop And Cassandra For Taxi Data Analytics: A Feasibility Study, Alvin Jun Yong Koh, Xuan Khoa Nguyen, C. Jason Woodard
Using Hadoop And Cassandra For Taxi Data Analytics: A Feasibility Study, Alvin Jun Yong Koh, Xuan Khoa Nguyen, C. Jason Woodard
Research Collection School Of Computing and Information Systems
This paper reports on a preliminary study to assess the feasibility of using the Open Cirrus Cloud Computing Research testbed to provide offline and online analytical support for taxi fleet operations. In the study, we benchmarked the performance gains from distributing the offline analysis of GPS location traces over multiple virtual machines using the Apache Hadoop implementation of the MapReduce paradigm. We also explored the use of the Apache Cassandra distributed database system for online retrieval of vehicle trace data. While configuring the testbed infrastructure was straightforward, we encountered severe I/O bottlenecks in running the benchmarks due to the lack …
Efficient Mutual Nearest Neighbor Query Processing For Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen, Gang Chen
Efficient Mutual Nearest Neighbor Query Processing For Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen, Gang Chen
Research Collection School Of Computing and Information Systems
Given a set D of trajectories, a query object q, and a query time extent Γ, a mutual (i.e., symmetric) nearest neighbor (MNN) query over trajectories finds from D, the set of trajectories that are among the k1 nearest neighbors (NNs) of q within Γ, and meanwhile, have q as one of their k2 NNs. This type of queries is useful in many applications such as decision making, data mining, and pattern recognition, as it considers both the proximity of the trajectories to q and the proximity of q to the trajectories. In this paper, we first formalize MNN search …
Do Wikipedians Follow Domain Experts? A Domain-Specific Study On Wikipedia Contribution, Yi Zhang, Aixin Sun, Anwitaman Datta, Kuiyu Chang, Ee Peng Lim
Do Wikipedians Follow Domain Experts? A Domain-Specific Study On Wikipedia Contribution, Yi Zhang, Aixin Sun, Anwitaman Datta, Kuiyu Chang, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Wikipedia is one of the most successful online knowledge bases, attracting millions of visits daily. Not surprisingly, its huge success has in turn led to immense research interest for a better understanding of the collaborative knowledge building process. In this paper, we performed a (terrorism) domain-specific case study, comparing and contrasting the knowledge evolution in Wikipedia with a knowledge base created by domain experts. Specifically, we used the Terrorism Knowledge Base (TKB) developed by experts at MIPT. We identified 409 Wikipedia articles matching TKB records, and went ahead to study them from three aspects: creation, revision, and link evolution. We …
Stevent: Spatio-Temporal Event Model For Social Network Discovery, Hady W. Lauw, Ee Peng Lim, Hwee Hwa Pang, Teck-Tim Tan
Stevent: Spatio-Temporal Event Model For Social Network Discovery, Hady W. Lauw, Ee Peng Lim, Hwee Hwa Pang, Teck-Tim Tan
Research Collection School Of Computing and Information Systems
Spatio-temporal data concerning the movement of individuals over space and time contains latent information on the associations among these individuals. Sources of spatio-temporal data include usage logs of mobile and Internet technologies. This article defines a spatio-temporal event by the co-occurrences among individuals that indicate potential associations among them. Each spatio-temporal event is assigned a weight based on the precision and uniqueness of the event. By aggregating the weights of events relating two individuals, we can determine the strength of association between them. We conduct extensive experimentation to investigate both the efficacy of the proposed model as well as the …
Efficient Processing Of Exact Top-K Queries Over Disk-Resident Sorted Lists, Hwee Hwa Pang, Xuhua Ding, Baihua Zheng
Efficient Processing Of Exact Top-K Queries Over Disk-Resident Sorted Lists, Hwee Hwa Pang, Xuhua Ding, Baihua Zheng
Research Collection School Of Computing and Information Systems
The top-k query is employed in a wide range of applications to generate a ranked list of data that have the highest aggregate scores over certain attributes. As the pool of attributes for selection by individual queries may be large, the data are indexed with per-attribute sorted lists, and a threshold algorithm (TA) is applied on the lists involved in each query. The TA executes in two phases--find a cut-off threshold for the top-k result scores, then evaluate all the records that could score above the threshold. In this paper, we focus on exact top-k queries that involve monotonic linear …