Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (20)
- Software Engineering (10)
- Numerical Analysis and Scientific Computing (7)
- Theory and Algorithms (6)
- OS and Networks (4)
-
- Social and Behavioral Sciences (4)
- Computer Engineering (3)
- Education (3)
- Engineering (3)
- Higher Education (3)
- Artificial Intelligence and Robotics (2)
- Communication (2)
- Graphics and Human Computer Interfaces (2)
- Arts and Humanities (1)
- Business (1)
- Communication Technology and New Media (1)
- Computer and Systems Architecture (1)
- Data Storage Systems (1)
- Educational Methods (1)
- Health Information Technology (1)
- Management Information Systems (1)
- Medicine and Health Sciences (1)
- Organizational Communication (1)
- Public Affairs, Public Policy and Public Administration (1)
- Television (1)
- Transportation (1)
- Urban Studies and Planning (1)
Articles 1 - 30 of 33
Full-Text Articles in Physical Sciences and Mathematics
Measuring Data Collection Diligence For Community Healthcare, Galawala Ramesha Samurdhi Karunasena, M. S. Ambiya, Arunesh Sinha, R. Nagar, S. Dalal, Abdullah. H., D. Thakkar, D. Narayanan, M. Tambe
Measuring Data Collection Diligence For Community Healthcare, Galawala Ramesha Samurdhi Karunasena, M. S. Ambiya, Arunesh Sinha, R. Nagar, S. Dalal, Abdullah. H., D. Thakkar, D. Narayanan, M. Tambe
Research Collection School Of Computing and Information Systems
Data analytics has tremendous potential to provide targeted benefit in low-resource communities, however the availability of highquality public health data is a significant challenge in developing countries primarily due to non-diligent data collection by community health workers (CHWs). Our use of the word non-diligence here is to emphasize that poor data collection is often not a deliberate action by CHW but arises due to a myriad of factors, sometime beyond the control of the CHW. In this work, we define and test a data collection diligence score. This challenging unlabeled data problem is handled by building upon domain expert’s guidance …
Base-Package Recommendation Framework Based On Consumer Behaviours In Iptv Platform, Kuruparan Shanmugalingam, Ruwinda Ranganayanke, Chanka Gunawardhaha, Rajitha Navarathna
Base-Package Recommendation Framework Based On Consumer Behaviours In Iptv Platform, Kuruparan Shanmugalingam, Ruwinda Ranganayanke, Chanka Gunawardhaha, Rajitha Navarathna
Research Collection School Of Computing and Information Systems
Internet Protocol TeleVision (IPTV) provides many services such as live television streaming, time-shifted media, and Video On Demand (VOD). However, many customers do not engage properly with their subscribed packages due to a lack of knowledge and poor guidance. Many customers fail to identify the proper IPTV service package based on their needs and to utilise their current package to the maximum. In this paper, we propose a base-package recommendation model with a novel customer scoring-meter based on customers behaviour. Initially, our paper describes an algorithm to measure customers engagement score, which illustrates a novel approach to track customer engagement …
Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu
Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu
Research Collection School Of Computing and Information Systems
Learning graphs from data automatically have shown encouraging performance on clustering and semisupervised learning tasks. However, real data are often corrupted, which may cause the learned graph to be inexact or unreliable. In this paper, we propose a novel robust graph learning scheme to learn reliable graphs from the real-world noisy data by adaptively removing noise and errors in the raw data. We show that our proposed model can also be viewed as a robust version of manifold regularized robust principle component analysis (RPCA), where the quality of the graph plays a critical role. The proposed model is able to …
Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao
Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao
Research Collection School Of Computing and Information Systems
Sparse data is known to pose challenges to cluster analysis, as the similarity between data tends to be ill-posed in the high-dimensional Hilbert space. Solutions in the literature typically extend either k-means or spectral clustering with additional steps on representation learning and/or feature weighting. However, adding these usually introduces new parameters and increases computational cost, thus inevitably lowering the robustness of these algorithms when handling massive ill-represented data. To alleviate these issues, this paper presents a class of self-organizing neural networks, called the salience-aware adaptive resonance theory (SA-ART) model. SA-ART extends Fuzzy ART with measures for cluster-wise salient feature modeling. …
Topicsummary: A Tool For Analyzing Class Discussion Forums Using Topic Based Summarizations, Swapna Gottipati, Venky Shankararaman, Renjini Ramesh
Topicsummary: A Tool For Analyzing Class Discussion Forums Using Topic Based Summarizations, Swapna Gottipati, Venky Shankararaman, Renjini Ramesh
Research Collection School Of Computing and Information Systems
This Innovative Practice full paper, describes the application of text mining techniques for extracting insights from a course based online discussion forum through generation of topic based summaries. Discussions, either in classroom or online provide opportunity for collaborative learning through exchange of ideas that leads to enhanced learning through active participation. Online discussions offer a number of benefits namely providing additional time to reflect and synthesize information before writing, providing a natural platform for students to voice their ideas without any one student dominating the conversation, and providing a record of the student’s thoughts. An online discussion forum provides a …
Redpc: A Residual Error-Based Density Peak Clustering Algorithm, Milan Parmar, Di Wang, Xiaofeng Zhang, Ah-Hwee Tan, Chunyan Miao, You Zhou
Redpc: A Residual Error-Based Density Peak Clustering Algorithm, Milan Parmar, Di Wang, Xiaofeng Zhang, Ah-Hwee Tan, Chunyan Miao, You Zhou
Research Collection School Of Computing and Information Systems
The density peak clustering (DPC) algorithm was designed to identify arbitrary-shaped clusters by finding density peaks in the underlying dataset. Due to its aptitudes of relatively low computational complexity and a small number of control parameters in use, DPC soon became widely adopted. However, because DPC takes the entire data space into consideration during the computation of local density, which is then used to generate a decision graph for the identification of cluster centroids, DPC may face difficulty in differentiating overlapping clusters and in dealing with low-density data points. In this paper, we propose a residual error-based density peak clustering …
Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao
Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao
Research Collection School Of Computing and Information Systems
The representation of categorical data with hierarchical value coupling relationships (i.e., various value-to-value cluster interactions) is very critical yet challenging for capturing complex data characteristics in learning tasks. This paper proposes a novel and flexible coupled unsupervised categorical data representation (CURE) framework, which not only captures the hierarchical couplings but is also flexible enough to be instantiated for contrastive learning tasks. CURE first learns the value clusters of different granularities based on multiple value coupling functions and then learns the value representation from the couplings between the obtained value clusters. With two complementary value coupling functions, CURE is instantiated into …
Evolutionary Trends In The Collaborative Review Process Of A Large Software System, Subhajit Datta, Poulami Sarkar
Evolutionary Trends In The Collaborative Review Process Of A Large Software System, Subhajit Datta, Poulami Sarkar
Research Collection School Of Computing and Information Systems
In this paper, we study the evolutionary trends in the collaborative review process of a large open source software system. As expected, the number of reviews, the number of reviews commented on, as well as the number of reviewers, and the interactions between them show increasing trends over time. But unexpectedly, levels of clustering between developers in their interaction networks show a decreasing trend, even as connections between them increase. In the context of our study, clustering is an indicator of developer collaboration, whereas connection points to how intensely developers work together. Thus the trends we observe can inform how …
Using Smart Card Data To Model Commuters’ Responses Upon Unexpected Train Delays, Xiancai Tian, Baihua Zheng
Using Smart Card Data To Model Commuters’ Responses Upon Unexpected Train Delays, Xiancai Tian, Baihua Zheng
Research Collection School Of Computing and Information Systems
The mass rapid transit (MRT) network is playing an increasingly important role in Singapore's transit network, thanks to its advantages of higher capacity and faster speed. Unfortunately, due to aging infrastructure, increasing demand, and other reasons like adverse weather condition, commuters in Singapore recently have been facing increasing unexpected train delays (UTDs), which has become a source of frustration for both commuters and operators. Most, if not all, existing works on delay management do not consider commuters' behavior. We dedicate this paper to the study of commuters' behavior during UTDs. We adopt a data-driven approach to analyzing the six-month' real …
Improving Reusability Of Software Libraries Through Usage Pattern Mining, Mohamed Aymen Saied, Ali Ouni, Houari A. Sahraoui, Raula Gaikovina Kula, Katsuro Inoue, David Lo
Improving Reusability Of Software Libraries Through Usage Pattern Mining, Mohamed Aymen Saied, Ali Ouni, Houari A. Sahraoui, Raula Gaikovina Kula, Katsuro Inoue, David Lo
Research Collection School Of Computing and Information Systems
Modern software systems are increasingly dependent on third-party libraries. It is widely recognized that using mature and well-tested third-party libraries can improve developers’ productivity, reduce time-to-market, and produce more reliable software. Today’s open-source repositories provide a wide range of libraries that can be freely downloaded and used. However, as software libraries are documented separately but intended to be used together, developers are unlikely to fully take advantage of these reuse opportunities. In this paper, we present a novel approach to automatically identify third-party library usage patterns, i.e., collections of libraries that are commonly used together by developers. Our approach employs …
Exploiting The Interdependency Of Land Use And Mobility For Urban Planning, Kasthuri Jayarajah, Andrew Tan, Archan Misra
Exploiting The Interdependency Of Land Use And Mobility For Urban Planning, Kasthuri Jayarajah, Andrew Tan, Archan Misra
Research Collection School Of Computing and Information Systems
Urban planners and economists alike have strong interest in understanding the inter-dependency of land use and people flow. The two-pronged problem entails systematic modeling and understanding of how land use impacts crowd flow to an area and in turn, how the influx of people to an area (or lack thereof) can influence the viability of business entities in that area. With cities becoming increasingly sensor-rich, for example, digitized payments for public transportation and constant trajectory tracking of buses and taxis, understanding and modelling crowd flows at the city scale, as well as, at finer granularity such as at the neighborhood …
How Does Developer Interaction Relate To Software Quality? An Examination Of Product Development Data, Subhajit Datta
How Does Developer Interaction Relate To Software Quality? An Examination Of Product Development Data, Subhajit Datta
Research Collection School Of Computing and Information Systems
Industrial software systems are being increasingly developed by large and distributed teams. Tools like collaborative development environments (CDE) are used to facilitate interaction between members of such teams, with the expectation that social factors around the interaction would facilitate team functioning. In this paper, we first identify typically social characteristics of interaction in a software development team: reachability, connection, association, and clustering. We then examine how these factors relate to the quality of software produced by a team, in terms of the number of defects, through an empirical study of 70+ teams, involving 900+ developers in total, spread across 30+ …
A Novel Density Peak Clustering Algorithm Based On Squared Residual Error, Milan Parmar, Di Wang, Ah-Hwee Tan, Chunyan Miao, Jianhua Jiang, You Zhou
A Novel Density Peak Clustering Algorithm Based On Squared Residual Error, Milan Parmar, Di Wang, Ah-Hwee Tan, Chunyan Miao, Jianhua Jiang, You Zhou
Research Collection School Of Computing and Information Systems
The density peak clustering (DPC) algorithm is designed to quickly identify intricate-shaped clusters with high dimensionality by finding high-density peaks in a non-iterative manner and using only one threshold parameter. However, DPC has certain limitations in processing low-density data points because it only takes the global data density distribution into account. As such, DPC may confine in forming low-density data clusters, or in other words, DPC may fail in detecting anomalies and borderline points. In this paper, we analyze the limitations of DPC and propose a novel density peak clustering algorithm to better handle low-density clustering tasks. Specifically, our algorithm …
A Conceptual Framework For Analyzing Students' Feedback, Venky Shankararaman, Swapna Gottipati, Sandy Gan
A Conceptual Framework For Analyzing Students' Feedback, Venky Shankararaman, Swapna Gottipati, Sandy Gan
Research Collection School Of Computing and Information Systems
In academic institutions it is normal practice that at the end of each term,students are required to complete a questionnaire that is designed to gather students’perceptions of the instructor and their learning experience in the course. This questionnaire comprises of Likert-scale questions and qualitative questions.One of the important goals of this exercise is to enable the instructor and the senior management to examine the feedback and then enhance students’ learning experience. In most universities, including our own, a lot of attention is paid to the quantitative feedback, which is summarized and statistical comparisons are computed, analysed and presented. However, the …
Semi-Automated Tool For Providing Effective Feedback On Programming Assignments, Min Yan Beh, Swapna Gottipati, David Lo, Venky Shankararaman
Semi-Automated Tool For Providing Effective Feedback On Programming Assignments, Min Yan Beh, Swapna Gottipati, David Lo, Venky Shankararaman
Research Collection School Of Computing and Information Systems
Human grading of introductory programming assignments is tedious and error-prone, hence researchers have attempted to develop tools that support automatic assessment of programming code. However, most such efforts often focus only on scoring solutions, rather than assessing whether students correctly understand the problems. To aid the students improve programming skills, effective feedback on programming assignments plays an important role. Individual feedback generation is tedious and painstaking process. We present a tool that not only automatically generates the static and dynamic program analysis outcomes, but also clusters similar code submissions to provide scalable and effective feedback to the students. We studied …
Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Research Collection School Of Computing and Information Systems
The large scale and complex nature of social media data raises the need to scale clustering techniques to big data and make them capable of automatically identifying data clusters with few empirical settings. In this paper, we present our investigation and three algorithms based on the fuzzy adaptive resonance theory (Fuzzy ART) that have linear computational complexity, use a single parameter, i.e., the vigilance parameter to identify data clusters, and are robust to modest parameter settings. The contribution of this paper lies in two aspects. First, we theoretically demonstrate how complement coding, commonly known as a normalization method, changes the …
Analyzing Educational Comments For Topics And Sentiments: A Text Analytics Approach, Gokran Ila Nitin, Swapna Gottipati, Venky Shankararaman
Analyzing Educational Comments For Topics And Sentiments: A Text Analytics Approach, Gokran Ila Nitin, Swapna Gottipati, Venky Shankararaman
Research Collection School Of Computing and Information Systems
Universities collect qualitative and quantitative feedback from students upon course completion in order to improve course quality and students’ learning experience. Combining program-wide and module-specific questions, universities collect feedback from students on three main aspects of a course namely, teaching style, content, and learning experience. The feedback is collected through both qualitative comments and quantitative scores. Current methods for analyzing the student course evaluations are manual and majorly focus on quantitative feedback and fall short of an in-depth exploration of qualitative feedback. In this paper, we develop student feedback mining system (SFMS) which applies text analytics and opinion mining approach …
Evaluation And Improvement Of Procurement Process With Data Analytics, Melvin H. C. Tan, Wee Leong Lee
Evaluation And Improvement Of Procurement Process With Data Analytics, Melvin H. C. Tan, Wee Leong Lee
Research Collection School Of Computing and Information Systems
Analytics can be applied in procurement to benefit organizations beyond just prevention and detection of fraud. This study aims to demonstrate how advanced data mining techniques such as text mining and cluster analysis can be used to improve visibility of procurement patterns and provide decision-makers with insight to develop more efficient sourcing strategies, in terms of cost and effort. A case study of an organization’s effort to improve its procurement process is presented in this paper. The findings from this study suggest that opportunities exist for organizations to aggregate common goods and services among the purchases made under and across …
Online Multimodal Co-Indexing And Retrieval Of Weakly Labeled Web Image Collections, Lei Meng, Ah-Hwee Tan, Cyril Leung, Liqiang Nie, Tan-Seng Chua, Chunyan Miao
Online Multimodal Co-Indexing And Retrieval Of Weakly Labeled Web Image Collections, Lei Meng, Ah-Hwee Tan, Cyril Leung, Liqiang Nie, Tan-Seng Chua, Chunyan Miao
Research Collection School Of Computing and Information Systems
Weak supervisory information of web images, such as captions, tags, and descriptions, make it possible to better understand images at the semantic level. In this paper, we propose a novel online multimodal co-indexing algorithm based on Adaptive Resonance Theory, named OMC-ART, for the automatic co-indexing and retrieval of images using their multimodal information. Compared with existing studies, OMC-ART has several distinct characteristics. First, OMCART is able to perform online learning of sequential data. Second, OMC-ART builds a two-layer indexing structure, in which the first layer co-indexes the images by the key visual and textual features based on the generalized distributions …
Active Semi-Supervised Defect Categorization, Ferdian Thung, Xuan-Bach D. Le, David Lo
Active Semi-Supervised Defect Categorization, Ferdian Thung, Xuan-Bach D. Le, David Lo
Research Collection School Of Computing and Information Systems
Defects are inseparable part of software development and evolution. To better comprehend problems affecting a software system, developers often store historical defects and these defects can be categorized into families. IBM proposes Orthogonal Defect Categorization (ODC) which include various classifications of defects based on a number of orthogonal dimensions (e.g., symptoms and semantics of defects, root causes of defects, etc.). To help developers categorize defects, several approaches that employ machine learning have been proposed in the literature. Unfortunately, these approaches often require developers to manually label a large number of defect examples. In practice, manually labelling a large number of …
Grumon: Fast And Accurate Group Monitoring For Heterogeneous Urban Spaces, Rijurekha Sen, Youngki Lee, Kasthuri Jayarajah, Rajesh Krishna Balan, Archan Misra
Grumon: Fast And Accurate Group Monitoring For Heterogeneous Urban Spaces, Rijurekha Sen, Youngki Lee, Kasthuri Jayarajah, Rajesh Krishna Balan, Archan Misra
Research Collection School Of Computing and Information Systems
Real-time monitoring of groups and their rich contexts will be a key building block for futuristic, group-aware mobile services. In this paper, we propose GruMon, a fast and accurate group monitoring system for dense and complex urban spaces. GruMon meets the performance criteria of precise group detection at low latencies by overcoming two critical challenges of practical urban spaces, namely (a) the high density of crowds, and (b) the imprecise location information available indoors. Using a host of novel features extracted from commodity smartphone sensors, GruMon can detect over 80% of the groups, with 97% precision, using 10 minutes latency …
Dynamic Clustering Of Contextual Multi-Armed Bandits, Trong T. Nguyen, Hady W. Lauw
Dynamic Clustering Of Contextual Multi-Armed Bandits, Trong T. Nguyen, Hady W. Lauw
Research Collection School Of Computing and Information Systems
With the prevalence of the Web and social media, users increasingly express their preferences online. In learning these preferences, recommender systems need to balance the trade-off between exploitation, by providing users with more of the "same", and exploration, by providing users with something "new" so as to expand the systems' knowledge. Multi-armed bandit (MAB) is a framework to balance this trade-off. Most of the previous work in MAB either models a single bandit for the whole population, or one bandit for each user. We propose an algorithm to divide the population of users into multiple clusters, and to customize the …
Scalable Visual Instance Mining With Threads Of Features, Wei Zhang, Hongzhi Li, Chong-Wah Ngo, Shih-Fu Chang
Scalable Visual Instance Mining With Threads Of Features, Wei Zhang, Hongzhi Li, Chong-Wah Ngo, Shih-Fu Chang
Research Collection School Of Computing and Information Systems
We address the problem of visual instance mining, which is to extract frequently appearing visual instances automatically from a multimedia collection. We propose a scalable mining method by exploiting Thread of Features (ToF). Specifically, ToF, a compact representation that links consistent features across images, is extracted to reduce noises, discover patterns, and speed up processing. Various instances, especially small ones, can be discovered by exploiting correlated ToFs. Our approach is significantly more effective than other methods in mining small instances. At the same time, it is also more efficient by requiring much fewer hash tables. We compared with several state-of-the-art …
Machine Learning In Wireless Sensor Networks: Algorithms, Strategies, And Applications, Mohammad Abu Alsheikh, Shaowei Lin, Dusit Niyato, Hwee-Pink Tan
Machine Learning In Wireless Sensor Networks: Algorithms, Strategies, And Applications, Mohammad Abu Alsheikh, Shaowei Lin, Dusit Niyato, Hwee-Pink Tan
Research Collection School Of Computing and Information Systems
Wireless sensor networks (WSNs) monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in WSNs. The advantages and disadvantages of each proposed algorithm are …
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 …
A Generalized Cluster Centroid Based Classifier For Text Categorization, Guansong Pang, Shengyi Jiang
A Generalized Cluster Centroid Based Classifier For Text Categorization, Guansong Pang, Shengyi Jiang
Research Collection School Of Computing and Information Systems
In this paper, a Generalized Cluster Centroid based Classifier (GCCC) and its variants for text categorization are proposed by utilizing a clustering algorithm to integrate two wellknown classifiers, i.e., the K-nearest-neighbor (KNN) classifier and the Rocchio classifier. KNN, a lazy learning method, suffers from inefficiency in online categorization while achieving remarkable effectiveness. Rocchio, which has efficient categorization performance, fails to obtain an expressive categorization model due to its inherent linear separability assumption. Our proposed method mainly focuses on two points: one point is that we use a clustering algorithm to strengthen the expressiveness of the Rocchio model; another one is …
The Social Network Of Software Engineering Research, Subhajit Datta, Nishant Kumar, Santonu Sarkar
The Social Network Of Software Engineering Research, Subhajit Datta, Nishant Kumar, Santonu Sarkar
Research Collection School Of Computing and Information Systems
The social network perspective has served as a useful framework for studying scientific research collaboration in different disciplines. Although collaboration in computer science research has received some attention, software engineering research collaboration has remained unexplored to a large extent. In this paper, we examine the collaboration networks based on co-authorship information of papers from ten software engineering publication venues over the 1976-2010 time period. We compare time variations of certain parameters of these networks with corresponding parameters of collaboration networks from other disciplines. We also explore whether software engineering collaboration networks manifest symptoms of the small-world phenomenon, conform to the …
An Automated Approach For Finding Variable-Constant Pairing Bugs, Julia Lawall, David Lo
An Automated Approach For Finding Variable-Constant Pairing Bugs, Julia Lawall, David Lo
Research Collection School Of Computing and Information Systems
Named constants are used heavily in operating systems code, both as internal flags and in interactions with devices. Decision making within an operating system thus critically depends on the correct usage of these values. Nevertheless, compilers for the languages typically used in implementing operating systems provide little support for checking the usage of named constants. This affects correctness, when a constant is used in a context where its value is meaningless, and software maintenance, when a constant has the right value for its usage context but the wrong name. We propose a hybrid program-analysis and data-mining based approach to identify …
Tagnsearch: Searching And Navigating Geo-Referenced Collections Of Photographs, Quang Minh Nguyen, Thi Nhu Quynh Kim, Dion Hoe-Lian Goh, Yin-Leng Theng, Ee Peng Lim, Aixin Sun, Chew-Hung Chang, Kalyani Chatterjea
Tagnsearch: Searching And Navigating Geo-Referenced Collections Of Photographs, Quang Minh Nguyen, Thi Nhu Quynh Kim, Dion Hoe-Lian Goh, Yin-Leng Theng, Ee Peng Lim, Aixin Sun, Chew-Hung Chang, Kalyani Chatterjea
Research Collection School Of Computing and Information Systems
TagNSearch is a map-based tool for searching and browsing geo-tagged photographs based on their associated tags. Using Flickr as the dataset, TagNSearch returns, for a given query, photographs clustered by locations, and summarizes each cluster of photographs by cluster-specific tags. A map-based interface is also provided to help users better search, navigate and browse photographs and their clusters. A qualitative evaluation comparing TagNSearch and an existing tag search support in Flickr was also conducted. The task involved finding locations associated with a set of photographs. Participants were found to perform this task better using TagNSearch than Flickr.
Multi-Order Neurons For Evolutionary Higher Order Clustering And Growth, Kiruthika Ramanathan, Sheng Uei Guan
Multi-Order Neurons For Evolutionary Higher Order Clustering And Growth, Kiruthika Ramanathan, Sheng Uei Guan
Research Collection School Of Computing and Information Systems
This letter proposes to use multiorder neurons for clustering irregularly shaped data arrangements. Multiorder neurons are an evolutionary extension of the use of higher-order neurons in clustering. Higher-order neurons parametrically model complex neuron shapes by replacing the classic synaptic weight by higher-order tensors. The multiorder neuron goes one step further and eliminates two problems associated with higher-order neurons. First, it uses evolutionary algorithms to select the best neuron order for a given problem. Second, it obtains more information about the underlying data distribution by identifying the correct order for a given cluster of patterns. Empirically we observed that when the …