Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems Commons™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 2131 - 2160 of 3441

Full-Text Articles in Databases and Information Systems

Online Probabilistic Learning For Fuzzy Inference System, Richard Jayadi Oentaryo, Meng Joo Er, San Linn, Xiang Li Sep 2014

Online Probabilistic Learning For Fuzzy Inference System, Richard Jayadi Oentaryo, Meng Joo Er, San Linn, Xiang Li

Research Collection School Of Computing and Information Systems

Online learning is a key methodology for expert systems to gracefully cope with dynamic environments. In the context of neuro-fuzzy systems, research efforts have been directed toward developing online learning methods that can update both system structure and parameters on the fly. However, the current online learning approaches often rely on heuristic methods that lack a formal statistical basis and exhibit limited scalability in the face of large data stream. In light of these issues, we develop a new Sequential Probabilistic Learning for Adaptive Fuzzy Inference System (SPLAFIS) that synergizes the Bayesian Adaptive Resonance Theory (BART) and Rule-Wise Decoupled Extended …

Go to article

Press: A Novel Framework Of Trajectory Compression In Road Networks, Renchu Song, Weiwei Sun, Baihua Zheng, Yu Zheng Sep 2014

Press: A Novel Framework Of Trajectory Compression In Road Networks, Renchu Song, Weiwei Sun, Baihua Zheng, Yu Zheng

Research Collection School Of Computing and Information Systems

Location data becomes more and more important. In this paper, we focus on the trajectory data, and propose a new framework, namely PRESS (Paralleled Road-Network-Based Trajectory Compression), to effectively compress trajectory data under road network constraints. Different from existing work, PRESS proposes a novel representation for trajectories to separate the spatial representation of a trajectory from the temporal representation, and proposes a Hybrid Spatial Compression (HSC) algorithm and error Bounded Temporal Compression (BTC) algorithm to compress the spatial and temporal information of trajectories respectively. PRESS also supports common spatial-temporal queries without fully decompressing the data. Through an extensive experimental study …

Go to article

Clear: A Real-Time Online Observatory For Bursty And Viral Events, Runquan Xie, Feida Zhu, Hui Ma, Wei Xie, Chen Lin Sep 2014

Clear: A Real-Time Online Observatory For Bursty And Viral Events, Runquan Xie, Feida Zhu, Hui Ma, Wei Xie, Chen Lin

Research Collection School Of Computing and Information Systems

We describe our demonstration of CLEar (Clairaudient Ear), a real-time online platform for detecting, monitoring, summarizing, contextualizing and visualizing bursty and viral events, those triggering a sudden surge of public interest and going viral on micro-blogging platforms. This task is challenging for existing methods as they either use complicated topic models to analyze topics in a off-line manner or define temporal structure of fixed granularity on the data stream for online topic learning, leaving them hardly scalable for real-time stream like that of Twitter. In this demonstration of CLEar, we present a three-stage system: First, we show …

Go to article

Graph Matching By Simplified Convex-Concave Relaxation Procedure, Zhiyong Liu, Hong Qiao, Xu Yang, Steven C. H. Hoi Sep 2014

Graph Matching By Simplified Convex-Concave Relaxation Procedure, Zhiyong Liu, Hong Qiao, Xu Yang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The convex and concave relaxation procedure (CCRP) was recently proposed and exhibited state-of-the-art performance on the graph matching problem. However, CCRP involves explicitly both convex and concave relaxations which typically are difficult to find, and thus greatly limit its practical applications. In this paper we propose a simplified CCRP scheme, which can be proved to realize exactly CCRP, but with a much simpler formulation without needing the concave relaxation in an explicit way, thus significantly simplifying the process of developing CCRP algorithms. The simplified CCRP can be generally applied to any optimizations over the partial permutation matrix, as long as …

Go to article

A Study Of Age Gaps Between Online Friends, Lizi Liao, Jing Jiang, Ee Peng Lim, Heyan Huang Sep 2014

A Study Of Age Gaps Between Online Friends, Lizi Liao, Jing Jiang, Ee Peng Lim, Heyan Huang

Research Collection School Of Computing and Information Systems

User attribute extraction on social media has gain considerable attention, while existing methods are mostly supervised which suffer great diffi- culty in insufficient gold standard data. In this paper, we validate a strong hypothesis based on homophily and adapt it to ensure the certainty of user attribute we extracted via weakly supervised propagation. Homophily, the theory which states that people who are similar tend to become friends, has been well studied in the setting of online social networks. When we focus on age attribute, based on this theory, online friends tend to have similar age. In this work, we take …

Go to article

Linking Lightweight And Heavyweight Systems Analysis By Converting Service Responsibility Tables Into Uml Diagrams, X. Tan, S. Alter, Keng Siau Sep 2014

Linking Lightweight And Heavyweight Systems Analysis By Converting Service Responsibility Tables Into Uml Diagrams, X. Tan, S. Alter, Keng Siau

Research Collection School Of Computing and Information Systems

Heavyweight systems analysis approaches such as the use of Unified Modeling Language (UML) are inappropriate for business professionals who nonetheless need to participate actively in systems analysis and design processes to ensure that the system requirements reflect their needs. This paper proposes the use of a lightweight analysis approach based on Service Responsibility Tables (SRTs) to serve as a front-end to UML diagrams. Business professionals (with or without the help of IT professionals) can use this lightweight approach to specify at least part of system requirements. Subsequently, IT professionals can perform heavyweight analysis for the design and implementation of hardware …

Go to article

Interestingness-Driven Diffussion Process Summarization In Dynamic Networks, Qiang Qu, Siyuan Liu, Christian Jensen, Feida Zhu, Christos Faloutsos Sep 2014

Interestingness-Driven Diffussion Process Summarization In Dynamic Networks, Qiang Qu, Siyuan Liu, Christian Jensen, Feida Zhu, Christos Faloutsos

Research Collection School Of Computing and Information Systems

The widespread use of social networks enables the rapid diffusion of information, e.g., news, among users in very large communities. It is a substantial challenge to be able to observe and understand such diffusion processes, which may be modeled as networks that are both large and dynamic. A key tool in this regard is data summarization. However, few existing studies aim to summarize graphs/networks for dynamics. Dynamic networks raise new challenges not found in static settings, including time sensitivity and the needs for online interestingness evaluation and summary traceability, which render existing techniques inapplicable. We study the topic of dynamic …

Go to article

An Exploratory Study On Software Microblogger Behaviors, Yuan Tian, David Lo Sep 2014

An Exploratory Study On Software Microblogger Behaviors, Yuan Tian, David Lo

Research Collection School Of Computing and Information Systems

Microblogging services are growing rapidly in the recent years. Twitter, one of the most popular microblogging sites, has gained more than 500 millions users. Thousands of developers are also using Twitter to communicate with one another and microblog about software-related topics such as programming languages, code libraries, etc. Understanding the behaviors of software microbloggers is one of the needed first steps toward building automated tools to encourage software microblogging activities and harness software microblogging to improve various software engineering activities. In this paper, we investigate the behaviors of software microbloggers in terms of their microblogging frequency, generated contents, and interactions …

Go to article

Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang Aug 2014

Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

In this paper we study a novel query type, called direct neighbor query. Two objects in a dataset are direct neighbors (DNs) if a window selection may exclusively retrieve these two objects. Given a source object, a DN search computes all of its direct neighbors in the dataset. The DNs define a new type of affinity that differs from existing formulations (e.g., nearest neighbors, nearest surrounders, reverse nearest neighbors, etc.) and finds application in domains where user interests are expressed in the form of windows, i.e., multi-attribute range selections. Drawing on key properties of the DN relationship, we develop an …

Go to article

Semantic Visualization For Spherical Representation, Tuan M. V. Le, Hady W. Lauw Aug 2014

Semantic Visualization For Spherical Representation, Tuan M. V. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Visualization of high-dimensional data such as text documents is widely applicable. The traditional means is to find an appropriate embedding of the high-dimensional representation in a low-dimensional visualizable space. As topic modeling is a useful form of dimensionality reduction that preserves the semantics in documents, recent approaches aim for a visualization that is consistent with both the original word space, as well as the semantic topic space. In this paper, we address the semantic visualization problem. Given a corpus of documents, the objective is to simultaneously learn the topic distributions as well as the visualization coordinates of documents. We propose …

Go to article

Gta-M: Greedy Trajectory-Aware (M Copies) Routing For Airborne Networks, Xiaoping Ma, Hwee Xian Tan, Alvin C. Valera Aug 2014

Gta-M: Greedy Trajectory-Aware (M Copies) Routing For Airborne Networks, Xiaoping Ma, Hwee Xian Tan, Alvin C. Valera

Research Collection School Of Computing and Information Systems

Airborne networks have potential applications in both civilian and military domains - such as passenger in-flight Internet connectivity, air traffic control and in intelligence, surveillance and reconnaissance (ISR) activities. However, airborne networks suffer from frequent disruptions due to high node mobility, ad hoc connectivity and line-of-sight blockages. These challenges can be alleviated through the use of disruption-tolerant networking (DTN) techniques. In this paper, we propose GTA-m, a multi-copy greedy trajectory-aware routing protocol for airborne networks. GTA-m employs DTN capabilities and exploits the use of flight information to forwarded bundles greedily to intended destination(s). To alleviate the local minima issues that …

Go to article

Utilizing Microblogs For Improving Automatic News High-Lights Extraction, Zhongyu Wei, Wei Gao Aug 2014

Utilizing Microblogs For Improving Automatic News High-Lights Extraction, Zhongyu Wei, Wei Gao

Research Collection School Of Computing and Information Systems

Story highlights form a succinct single-document summary consisting of 3-4 highlight sentences that reflect the gist of a news article. Automatically producing news highlights is very challenging. We propose a novel method to improve news highlights extraction by using microblogs. The hypothesis is that microblog posts, although noisy, are not only indicative of important pieces of information in the news story, but also inherently “short and sweet” resulting from the artificial compression effect due to the length limit. Given a news article, we formulate the problem as two rank-then-extract tasks: (1) we find a set of indicative tweets and use …

Go to article

Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu Aug 2014

Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu

Research Collection School Of Computing and Information Systems

For better viral marketing, there has been a lot of research on social influence maximization. However, the problem that who is influenced and how diverse the influenced population is, which is important in real-world marketing, has largely been neglected. To that end, in this paper, we propose to consider the magnitude of influence and the diversity of the influenced crowd simultaneously. Specifically, we formulate it as an optimization problem, i.e., diversified social influence maximization. First, we present a general framework for this problem, under which we construct a class of diversity measures to quantify the diversity of the influenced crowd. …

Go to article

Urban Planning Process: Can Technology Enhance Participatory Communication?, Rojin Vishkaie, Richard Levy, Anthony Tang Aug 2014

Urban Planning Process: Can Technology Enhance Participatory Communication?, Rojin Vishkaie, Richard Levy, Anthony Tang

Research Collection School Of Computing and Information Systems

Oftentimes, within the urban planning process, urban planners and GIS experts must work together using desktop Computer-Aided Design (CAD) and Geographic Information System (GIS). However, participatory communication and visualization which are important in the urban planning process, are not a central focus in the design of current computer-aided planning technologies. This study tends to provide an understanding of technological challenges and complexities urban planners and GIS experts encounter while engaging in a participatory environment during the urban planning process. This study also explores the perceptions of urban planners and GIS experts about the potential impact and usefulness of interactive surfaces …

Go to article

Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow Aug 2014

Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the tasks for large DOPs, the multi-agent reinforcement learning (MARL) framework is adopted wherein an agent is used to learn the performance of each distinct task using reinforcement learning. To coordinate MARL, we propose a novel coordination strategy integrating Motivated Learning (ML) …

Go to article

Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain Aug 2014

Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain

Research Collection School Of Computing and Information Systems

We study the problem of online multitask learning for solving multiple related classification tasks in parallel, aiming at classifying every sequence of data received by each task accurately and efficiently. One practical example of online multitask learning is the micro-blog sentiment detection on a group of users, which classifies micro-blog posts generated by each user into emotional or non-emotional categories. This particular online learning task is challenging for a number of reasons. First of all, to meet the critical requirements of online applications, a highly efficient and scalable classification solution that can make immediate predictions with low learning cost is …

Go to article

Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao Aug 2014

Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao

Research Collection School Of Computing and Information Systems

In this paper we study how to summarize travel-related information in forum threads to generate supplementary travel guides. Such summaries presumably can provide additional and more up-to-date information to tourists. Existing multi-document summarization methods have limitations for this task because (1) they do not generate structured summaries but travel guides usually follow a certain template, and (2) they do not put emphasis on named entities but travel guides often recommend points of interest to travelers. To overcome these limitations, we propose to use a latent variable model to align forum threads with the section structure of well-written travel guides. The …

Go to article

Jointly Modeling Aspects, Ratings And Sentiments For Movie Recommendation (Jmars), Qiming Diao, Minghui Qiu, Chao-Yuan Wu, Alexander J. Smola, Jing Jiang, Chong Wang Aug 2014

Jointly Modeling Aspects, Ratings And Sentiments For Movie Recommendation (Jmars), Qiming Diao, Minghui Qiu, Chao-Yuan Wu, Alexander J. Smola, Jing Jiang, Chong Wang

Research Collection School Of Computing and Information Systems

Recommendation and review sites offer a wealth of information beyond ratings. For instance, on IMDb users leave reviews, commenting on different aspects of a movie (e.g. actors, plot, visual effects), and expressing their sentiments (positive or negative) on these aspects in their reviews. This suggests that uncovering aspects and sentiments will allow us to gain a better understanding of users, movies, and the process involved in generating ratings. The ability to answer questions such as “Does this user care more about the plot or about the special effects?” or ”What is the quality of the movie in terms of acting?” …

Go to article

Guest Editorial: Special Issue On Brain Inspired Models Of Cognitive Memory, Huajin Tang, Kiruthika Ramanathan, Ning Nign Aug 2014

Guest Editorial: Special Issue On Brain Inspired Models Of Cognitive Memory, Huajin Tang, Kiruthika Ramanathan, Ning Nign

Research Collection School Of Computing and Information Systems

Current memory technologies have experienced significant progress in terms of storage capacity, operation speed, integration capability, etc. However, their functions are highly constrained in storing and transferring data in space and time, prompting the need for improvement. In contrast to physical memories, the biological counterpart – cognitive memory – has versatile functions. For instance, human memory stores data associatively such that different modalities of data could be retrieved simultaneously; it can learn different concepts, categorize and store them in an organized manner; it can process and store data concurrently and in a distributed fashion; it can restore content even if …

Go to article

Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow Aug 2014

Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the tasks for large DOPs, the multi-agent reinforcement learning (MARL) framework is adopted wherein an agent is used to learn the performance of each distinct task using reinforcement learning. To coordinate MARL, we propose a novel coordination strategy integrating Motivated Learning (ML) …

Go to article

On Macro And Micro Exploration Of Hashtag Diffusion In Twitter, Yazhe Wang, Baihua Zheng Aug 2014

On Macro And Micro Exploration Of Hashtag Diffusion In Twitter, Yazhe Wang, Baihua Zheng

Research Collection School Of Computing and Information Systems

This exploratory work studies hashtag diffusion in Twitter. The analysis is conducted from two aspects. From the macro perspective, we study general properties of hashtag diffusion, and classify hashtags into three main classes based on their temporal dynamics referred as 'single spike', 'multi-spikes', and 'fluctuation', and find that each of these classes has some unique characteristics. From the micro perspective, we investigate individual diffusion.We adopt Edelman's 'topology of influence' theory to identify four type of users with different influence levels in diffusion based on their dynamic retweet behaviors. The results of our study are useful for gaining more insights of …

Go to article

Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li Aug 2014

Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li

Research Collection School Of Computing and Information Systems

Kernel-based regression represents an important family of learning techniques for solving challenging regression tasks with non-linear patterns. Despite being studied extensively, most of the existing work suffers from two major drawbacks: (i) they are often designed for solving regression tasks in a batch learning setting, making them not only computationally inefficient and but also poorly scalable in real-world applications where data arrives sequentially; and (ii) they usually assume a fixed kernel function is given prior to the learning task, which could result in poor performance if the chosen kernel is inappropriate. To overcome these drawbacks, this paper presents a novel …

Go to article

Ranking Model Selection And Fusion For Effective Microblog Search, Zhongyu Wei, Wei Gao, Tarek El-Ganainy, Walid Magdy, Kam-Fai Wong Jul 2014

Ranking Model Selection And Fusion For Effective Microblog Search, Zhongyu Wei, Wei Gao, Tarek El-Ganainy, Walid Magdy, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Re-ranking was shown to have positive impact on the effectiveness for microblog search. Yet existing approaches mostly focused on using a single ranker to learn some better ranking function with respect to various relevance features. Given various available rank learners (such as learning to rank algorithms), in this work, we mainly study an orthogonal problem where multiple learned ranking models form an ensemble for re-ranking the retrieved tweets than just using a single ranking model in order to achieve higher search effectiveness. We explore the use of query-sensitive model selection and rank fusion methods based on the result lists produced …

Go to article

On Predicting Religion Labels In Microblogging Networks, Minh Thap Nguyen, Ee Peng Lim Jul 2014

On Predicting Religion Labels In Microblogging Networks, Minh Thap Nguyen, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Religious belief plays an important role in how people behave, influencing how they form preferences, interpret events around them, and develop relationships with others. Traditionally, the religion labels of user population are obtained by conducting a large scale census study. Such an approach is both high cost and time consuming. In this paper, we study the problem of predicting users' religion labels using their microblogging data. We formulate religion label prediction as a classification task, and identify content, structure and aggregate features considering their self and social variants for representing a user. We introduce the notion of representative user to …

Go to article

User Daily Activity Pattern Learning: A Multi-Memory Modeling Approach, Shan Gao, Ah-Hwee Tan Jul 2014

User Daily Activity Pattern Learning: A Multi-Memory Modeling Approach, Shan Gao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

In this paper, we propose a multi-memory model, ADLART model, to discover the daily activity pattern of a sensor monitored user from his/her activities of daily living (ADL). The proposed model mimics the human multiple memory system which comprises a working memory, an episodic memory, and a semantic memory. Through encoding user's daily activities patterns in episodic memory and extracting the regularities of activity routines in semantic memory, the ADLART system is able to learn, recognize, compare, and retrieve daily ADL patterns of the user. Experiments are presented to show the performance of the ADLART model using different parameter settings …

Go to article

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li Jul 2014

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li

Research Collection School Of Computing and Information Systems

Spectral hashing (SpH) is an efficient and simple binary hashing method, which assumes that data are sampled from a multidimensional uniform distribution. However, this assumption is too restrictive in practice. In this paper we propose an improved method, fitted spectral hashing (FSpH), to relax this distribution assumption. Our work is based on the fact that one-dimensional data of any distribution could be mapped to a uniform distribution without changing the local neighbor relations among data items. We have found that this mapping on each PCA direction has certain regular pattern, and could be fitted well by S-curve function (Sigmoid function). …

Go to article

Board Interlock Networks And The Use Of Relative Performance Evaluation, Qian Hao, Nan Hu, Ling Liu, Lee J. Yao Jul 2014

Board Interlock Networks And The Use Of Relative Performance Evaluation, Qian Hao, Nan Hu, Ling Liu, Lee J. Yao

Research Collection School Of Computing and Information Systems

Purpose - The purpose of this paper is to explore how networks of boards of directors affect relative performance evaluation (RPE) in chief executive officer (CEO) compensation. Design/methodology/approach - In this study, the authors propose that an interlocking network is an important inter-corporate setting, which has a bearing on whether boards decide to use RPE in CEO compensation. They adopt four typical graph measures to depict the centrality/position of each board in the interlock network: degree, betweenness, eigenvector and closeness, and study their impacts on RPE use. Findings - The authors find that firms that have more connected board members …

Go to article

Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow Jul 2014

Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Most non-trivial problems require the coordinated performance of multiple goal-oriented and time-critical tasks. Coordinating the performance of the tasks is required due to the dependencies among the tasks and the sharing of resources. In this work, an agent learns to perform a task using reinforcement learning with a self-organizing neural network as the function approximator. We propose a novel coordination strategy integrating Motivated Learning (ML) and a self-organizing neural network for multi-agent reinforcement learning (MARL). Specifically, we adapt the ML idea of using pain signal to overcome the resource competition issue. Dependency among the agents is resolved using domain knowledge …

Go to article

Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang Jul 2014

Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang

Research Collection School Of Computing and Information Systems

A big challenge in text classification is to perform classification on a large-scale and high-dimensional text corpus in the presence of imbalanced class distributions and a large number of irrelevant or noisy term features. A number of techniques have been proposed to handle this challenge with varying degrees of success. In this paper, by combining the strengths of two widely used text classification techniques, K-Nearest-Neighbor (KNN) and centroid based (Centroid) classifiers, we propose a scalable and effective flat classifier, called CenKNN, to cope with this challenge. CenKNN projects high-dimensional (often hundreds of thousands) documents into a low-dimensional (normally a few …

Go to article

A Retail Bank's Bpm Experience, Shankararaman, Venky, Gottipati Swapna, Randall E. Duran Jul 2014

A Retail Bank's Bpm Experience, Shankararaman, Venky, Gottipati Swapna, Randall E. Duran

Research Collection School Of Computing and Information Systems

This real-life case study, which was undertaken by a leading financial services group in the Asia-Pacific region, is used to demonstrate the innovative use of BPM (Business Process Management) technology in a competitive business area. It describes how a BPM project, within the Application Verification and Capture (AVC), was conceived, designed and implemented in order to deliver strategic value to the organization. Hereafter, the financial services group will be referred to as “the bank”. The AVC project was targeted at one of the bank's processes called the Application Verification and Capture (AVC) process for unit trust products. This process involved …

Go to article

First Prev Next Last