Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Adaptive Resonance Theory (1)
- Adaptive parameter tuning (1)
- Application migration (1)
- Availability (1)
- Backscatter communication (1)
-
- Big social media data (1)
- Clustering (1)
- Compressive sensing (1)
- Cross-validation (1)
- Information matrix test (1)
- Link size (1)
- Market liquidity (1)
- Maximum likelihood estimation (1)
- Mobile cloud computing (1)
- Model misspecification testing (1)
- Nested recursive logit (1)
- Network centrality Commuter flow centrality Delay flow centrality Visual analytics Transportation network (1)
- Network effects (1)
- Neuromorphic (1)
- Neuron Model (1)
- Path size logit (1)
- Persistent Firing (1)
- Product differentiation (1)
- RFID (1)
- Recursive logit (1)
- Replica placement (1)
- Replication (1)
- Route choice (1)
- Route choice modeling (1)
- Shopping behavior (1)
Articles 1 - 13 of 13
Full-Text Articles in OS and Networks
Learning And Controlling Network Diffusion In Dependent Cascade Models, Jiali Du, Pradeep Varakantham, Akshat Kumar, Shih-Fen Cheng
Learning And Controlling Network Diffusion In Dependent Cascade Models, Jiali Du, Pradeep Varakantham, Akshat Kumar, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Diffusion processes have increasingly been used to represent flow of ideas, traffic and diseases in networks. Learning and controlling the diffusion dynamics through management actions has been studied extensively in the context of independent cascade models, where diffusion on outgoing edges from a node are independent of each other. Our work, in contrast, addresses (a) learning diffusion taking management actions to alter the diffusion dynamics to achieve a desired outcome in dependent cascade models. A key characteristic of such dependent cascade models is the flow preservation at all nodes in the network. For example, traffic and people flow is preserved …
Fast Reinforcement Learning Under Uncertainties With Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan
Fast Reinforcement Learning Under Uncertainties With Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Using feedback signals from the environment, a reinforcement learning (RL) system typically discovers action policies that recommend actions effective to the states based on a Q-value function. However, uncertainties over the estimation of the Q-values can delay the convergence of RL. For fast RL convergence by accounting for such uncertainties, this paper proposes several enhancements to the estimation and learning of the Q-value using a self-organizing neural network. Specifically, a temporal difference method known as Q-learning is complemented by a Q-value Polarization procedure, which contrasts the Q-values using feedback signals on the effect of the recommended actions. The polarized Q-values …
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 …
A Misspecification Test For Logit Based Route Choice Models, Tien Mai, Emma Frejinger, Fabian Bastin
A Misspecification Test For Logit Based Route Choice Models, Tien Mai, Emma Frejinger, Fabian Bastin
Research Collection School Of Computing and Information Systems
The multinomial logit (MNL) model is often used for analyzing route choices in real networks in spite of the fact that path utilities are believed to be correlated. Yet, statistical tests for model misspecification are rarely used. This paper shows how the information matrix test for model misspecification proposed byWhite (1982) can be applied to test path-based and link-based MNL route choice models.We present a Monte Carlo experiment using simulated data to assess the size and the power of the test and to compare its performance with the IIA (Hausman and McFadden, 1984) and McFadden–Train Lagrange multiplier (McFadden and Train, …
Bring-Your-Own-Application (Byoa): Optimal Stochastic Application Migration In Mobile Cloud Computing, Jonathan David Chase, Dusit Niyato, Sivadon Chaisiri
Bring-Your-Own-Application (Byoa): Optimal Stochastic Application Migration In Mobile Cloud Computing, Jonathan David Chase, Dusit Niyato, Sivadon Chaisiri
Research Collection School Of Computing and Information Systems
The increasing popularity of using mobile devices in a work context, has led to the need to be able to support more powerful computation. Users no longer remain in an office or at home to conduct their activities, preferring libraries and cafes. In this paper, we consider a mobile cloud computing scenario in which users bring their own mobile devices and are offered a variety of equipment, e.g., desktop computer, smart- TV, or projector, to migrate their applications to, so as to save battery life, improve usability and performance. We formulate a stochastic optimization problem to optimize the allocation of …
Shopminer: Mining Customer Shopping Behavior In Physical Clothing Stores With Passive Rfids, Longfei Shangguan, Zimu Zhou, Xiaolong Zheng, Lei Yang, Yunhao Liu, Jinsong Han
Shopminer: Mining Customer Shopping Behavior In Physical Clothing Stores With Passive Rfids, Longfei Shangguan, Zimu Zhou, Xiaolong Zheng, Lei Yang, Yunhao Liu, Jinsong Han
Research Collection School Of Computing and Information Systems
Shopping behavior data are of great importance to understand the effectiveness of marketing and merchandising efforts. Online clothing stores are capable capturing customer shopping behavior by analyzing the click stream and customer shopping carts. Retailers with physical clothing stores, however, still lack effective methods to identify comprehensive shopping behaviors. In this paper, we show that backscatter signals of passive RFID tags can be exploited to detect and record how customers browse stores, which items of clothes they pay attention to, and which items of clothes they usually match with. The intuition is that the phase readings of tags attached on …
Endogenous Network Effects, Platform Pricing And Market Liquidity, Mei Lin, Ruhai Wu, Wen Zhou
Endogenous Network Effects, Platform Pricing And Market Liquidity, Mei Lin, Ruhai Wu, Wen Zhou
Research Collection School Of Computing and Information Systems
This paper examines a monopoly platform's two-sided pricing strategies in a setting with seller competition, which gives rise to not only positive cross-side network effects between buyers and sellers, but also a negative same-side network effect among sellers. We show that platform pricing depends crucially on the characteristics associated with market liquidity, which contrasts with the previous studies that point to the two sides' relative demand elasticities and/or network effects. A market is said to be more liquid when it has less friction, resulting in a larger total surplus for the platform economy and hence greater equilibrium entry on both …
Towards A Robust Sparse Data Representation In Wireless Sensor Networks, Abu Alsheik Mohammad, Shaowei Lin, Hwee-Pink Tan, Dusit Niyato
Towards A Robust Sparse Data Representation In Wireless Sensor Networks, Abu Alsheik Mohammad, Shaowei Lin, Hwee-Pink Tan, Dusit Niyato
Research Collection School Of Computing and Information Systems
Compressive sensing has been successfully used for optimized operations in wireless sensor networks. However, raw data collected by sensors may be neither originally sparse nor easily transformed into a sparse data representation. This paper addresses the problem of transforming source data collected by sensor nodes into sparse representation with a few nonzero elements. Our contributions that address three major issues include: 1) an effective method that extracts population sparsity of the data, 2) a sparsity ratio guarantee scheme, and 3) a customized leaerning algorithm of the sparsifying dictionary. We introduce an unsupervised neural network to extract an intrinsic sparse coding …
Replica Placement For Availability In The Worst Case, Peng Li, Debin Gao, Mike Reiter
Replica Placement For Availability In The Worst Case, Peng Li, Debin Gao, Mike Reiter
Research Collection School Of Computing and Information Systems
We explore the problem of placing object replicas on nodes in a distributed system to maximize the number of objects that remain available when node failures occur. In our model, failing (the nodes hosting) a given threshold of replicas is sufficient to disable each object, and the adversary selects which nodes to fail to minimize the number of objects that remain available. We specifically explore placement strategies based on combinatorial structures called t-packings; provide a lower bound for the object availability they offer; show that these placements offer availability that is c-competitive with optimal; propose an efficient algorithm for computing …
Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu
Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu
Research Collection School Of Computing and Information Systems
In an urban city, its transportation network supports efficient flow of people between different parts of the city. Failures in the network can cause major disruptions to commuter and business activities which can result in both significant economic and time losses. In this paper, we investigate the use of centrality measures to determine critical nodes in a transportation network so as to improve the design of the network as well as to devise plans for coping with the network failures. Most centrality measures in social network analysis research unfortunately consider only topological structure of the network and are oblivious of …
A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger
A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger
Research Collection School Of Computing and Information Systems
We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination. The value …
Memory Dynamics In Attractor Networks, Guoqi Li, Kiruthika Ramanathan, Ning Ning, Luping Shi, Changyun Wen
Memory Dynamics In Attractor Networks, Guoqi Li, Kiruthika Ramanathan, Ning Ning, Luping Shi, Changyun Wen
Research Collection School Of Computing and Information Systems
As can be represented by neurons and their synaptic connections, attractor networks are widely believed to underlie biological memory systems and have been used extensively in recent years to model the storage and retrieval process of memory. In this paper, we propose a new energy function, which is nonnegative and attains zero values only at the desired memory patterns. An attractor network is designed based on the proposed energy function. It is shown that the desired memory patterns are stored as the stable equilibrium points of the attractor network. To retrieve a memory pattern, an initial stimulus input is presented …
Modeling Neuromorphic Persistent Firing Networks, Ning Ning, Guoqi Li, Wei He, Kejie Huang, Li Pan, Kiruthika Ramanathan, Rong Zhao, Luping Shi
Modeling Neuromorphic Persistent Firing Networks, Ning Ning, Guoqi Li, Wei He, Kejie Huang, Li Pan, Kiruthika Ramanathan, Rong Zhao, Luping Shi
Research Collection School Of Computing and Information Systems
Neurons are believed to be the brain computational engines of the brain. A recent discovery in neurophysiology reveals that interneurons can slowly integrate spiking, share the output across a coupled network of axons and respond with persistent firing even in the absence of input to the soma or dendrites, which has not been understood and could be very important for exploring the mechanism of human cognition. The conventional models are incapable of simulating the important newly-discovered phenomenon of persistent firing induced by axonal slow integration. In this paper, we propose a computationally efficient model of neurons through modeling the axon …