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

Physical Sciences and Mathematics Commons™

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

Singapore Management University

2007

Discipline
Keyword
Publication

Articles 1 - 30 of 157

Full-Text Articles in Physical Sciences and Mathematics

Study Of The Minimum Spanning Hyper-Tree Routing Algorithm In Wireless Sensor Networks, Ting Yang, Yugeng Sun, Zhaoxia Wang, Juwei Zhang, Yingqiang Ding Dec 2007

Study Of The Minimum Spanning Hyper-Tree Routing Algorithm In Wireless Sensor Networks, Ting Yang, Yugeng Sun, Zhaoxia Wang, Juwei Zhang, Yingqiang Ding

Research Collection School Of Computing and Information Systems

Designing energy-efficient routing protocols to effectively increase the networks' lifetime and provide the robust network service is one of the important problems in the research of wireless sensor networks. Using the hyper-graph theory, the paper represents large-scale wireless sensor networks into a hyper-graph model, which can effectively decrease the control messages in routing process. Based on this mathematic model, the paper presents the minimum spanning hyper-tree routing algorithm in synchronous wireless sensor networks (MSHT-SN), which builds a minimum energy consumption tree for data collection from multi-nodes to Sink node. The validity of the algorithm is proved by the theatrical analysis. …

Go to article

A Unified Interdisciplinary Theory Of Open Source Culture And Entertainment, Jerald Hughes, Karl Reiner Lang, Eric K. Clemons, Robert J. Kauffman Dec 2007

A Unified Interdisciplinary Theory Of Open Source Culture And Entertainment, Jerald Hughes, Karl Reiner Lang, Eric K. Clemons, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Digital technologies are profoundly transforming the production and consumption of culture and entertainment products. The emerging digital re-mix culture is an open source approach where content products in the arts and entertainment industries are increasingly rearranged, manipulated, and extended in the process of creating new works. This article offers a unified description of the tools and techniques that led to the development of the open source culture and that enable the processes which promote re-use of previously recorded materials. It then lays out the incentives and forces that either promote or inhibit the development, distribution, and consumption of modified cultural …

Go to article

Location Update Versus Paging Trade-Off In Cellular Networks: An Approach Based On Vector Quantization, Abhishek Roy, Archan Misra, Sajal K. Das Dec 2007

Location Update Versus Paging Trade-Off In Cellular Networks: An Approach Based On Vector Quantization, Abhishek Roy, Archan Misra, Sajal K. Das

Research Collection School Of Computing and Information Systems

In this paper we propose two information-theoretic techniques for efficiently trading off the location update and paging costs associated with mobility management in wireless cellular networks. Previous approaches attempt to always accurately convey a mobile's movement sequence and hence, cannot reduce the signaling cost below the entropy bound. Our proposed techniques, however, exploit rate-distortion theory to arbitrarily reduce the update cost, at the expense of an increase in the corresponding paging overhead. To this end, we describe two location tracking algorithms, based on spatial quantization and temporal quantization, which first quantize the movement sequence into a smaller set of codewords, …

Go to article

I’M A Virus Harming The Earth, M. Thulasidas Dec 2007

I’M A Virus Harming The Earth, M. Thulasidas

Research Collection School Of Computing and Information Systems

We humans plunder the raw material from our host planet with such an abandon that is only seen in viruses.

Go to article

Tuning Tabu Search Strategies Via Visual Diagnosis, Steven Halim, Hoong Chuin Lau Dec 2007

Tuning Tabu Search Strategies Via Visual Diagnosis, Steven Halim, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

While designing working metaheuristics can be straightforward, tuning them to solve the underlying combinatorial optimization problem well can be tricky. Several tuning methods have been proposed but they do not address the new aspect of our proposed classification of the metaheuristic tuning problem: tuning search strategies. We propose a tuning methodology based on Visual Diagnosis and a generic tool called Visualizer for Metaheuristics Development Framework(V-MDF) to address specifically the problem of tuning search (particularly Tabu Search) strategies. Under V-MDF, we propose the use of a Distance Radar visualizer where the human and computer can collaborate to diagnose the occurrence of …

Go to article

Self-Organizing Neural Architectures And Cooperative Learning In A Multiagent Environment, Dan Xiao, Ah-Hwee Tan Dec 2007

Self-Organizing Neural Architectures And Cooperative Learning In A Multiagent Environment, Dan Xiao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Temporal-Difference–Fusion Architecture for Learning, Cognition, and Navigation (TD-FALCON) is a generalization of adaptive resonance theory (a class of self-organizing neural networks) that incorporates TD methods for real-time reinforcement learning. In this paper, we investigate how a team of TD-FALCON networks may cooperate to learn and function in a dynamic multiagent environment based on minefield navigation and a predator/prey pursuit tasks. Experiments on the navigation task demonstrate that TD-FALCON agent teams are able to adapt and function well in a multiagent environment without an explicit mechanism of collaboration. In comparison, traditional Q-learning agents using gradient-descent-based feedforward neural networks, trained with the …

Go to article

Multi-Order Neurons For Evolutionary Higher Order Clustering And Growth, Kiruthika Ramanathan, Sheng Uei Guan Dec 2007

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 …

Go to article

Preventing Location-Based Identity Inference In Anonymous Spatial Queries, Panos Kalnis, Gabriel Ghinita, Kyriakos Mouratidis, Dimitris Papadias Dec 2007

Preventing Location-Based Identity Inference In Anonymous Spatial Queries, Panos Kalnis, Gabriel Ghinita, Kyriakos Mouratidis, Dimitris Papadias

Research Collection School Of Computing and Information Systems

The increasing trend of embedding positioning capabilities (for example, GPS) in mobile devices facilitates the widespread use of location-based services. For such applications to succeed, privacy and confidentiality are essential. Existing privacy-enhancing techniques rely on encryption to safeguard communication channels, and on pseudonyms to protect user identities. Nevertheless, the query contents may disclose the physical location of the user. In this paper, we present a framework for preventing location-based identity inference of users who issue spatial queries to location-based services. We propose transformations based on the well-established K-anonymity concept to compute exact answers for range and nearest neighbor search, without …

Go to article

Competition In Modular Clusters, Carliss Y. Baldwin, C. Jason Woodard Dec 2007

Competition In Modular Clusters, Carliss Y. Baldwin, C. Jason Woodard

Research Collection School Of Computing and Information Systems

The last twenty years have witnessed the rise of disaggregated “clusters,” “networks,” or “ecosystems” of firms. In these clusters the activities of R&D, product design, production, distribution, and system integration may be split up among hundreds or even thousands of firms. Different firms will design and produce the different components of a complex artifact (like the processor, peripherals, and software of a computer system), and different firms will specialize in different stages of a complex production process. This paper considers the pricing behavior and profitability of these so-called modular clusters. In particular, we investigate a possibility hinted at in prior …

Go to article

An Empirical Analysis Of Mobile Voice Service And Sms: A Structural Model, Youngsoo Kim, William B. Vogt, Ramayya Krishnan, Rahul Telang Dec 2007

An Empirical Analysis Of Mobile Voice Service And Sms: A Structural Model, Youngsoo Kim, William B. Vogt, Ramayya Krishnan, Rahul Telang

Research Collection School Of Computing and Information Systems

In addition to the wireless telephony boom, a similar exponential increasing trend in wireless data service - short message service (SMS) - is visible as technology advances. We develop a structural model to understand how mobile users behave, especially how they consume voice, and services. Specifically, we measure the own- and the cross-price elasticities of these services. The cross-price elasticity is of significant importance because marketing activities are critically influenced by whether the goods are substitutes or complements. The research context poses significant econometric challenges due to three-part tariff, sequential discrete plan choice and continuous quantity choices. Using detailed individual …

Go to article

Experimenting Vireo-374: Bag-Of-Visual-Words And Visual-Based Ontology For Semantic Video Indexing And Search, Chong-Wah Ngo, Yu-Gang Jiang, Xiaoyong Wei, Feng Wang, Wanlei Zhao, Hung-Khoon Tan, Xiao Wu Nov 2007

Experimenting Vireo-374: Bag-Of-Visual-Words And Visual-Based Ontology For Semantic Video Indexing And Search, Chong-Wah Ngo, Yu-Gang Jiang, Xiaoyong Wei, Feng Wang, Wanlei Zhao, Hung-Khoon Tan, Xiao Wu

Research Collection School Of Computing and Information Systems

In this paper, we present our approaches and results of high-level feature extraction and automatic video search in TRECVID-2007.

Go to article

Comment-Oriented Blog Summarization By Sentence Extraction, Meishan Hu, Ee Peng Lim, Aixin Sun Nov 2007

Comment-Oriented Blog Summarization By Sentence Extraction, Meishan Hu, Ee Peng Lim, Aixin Sun

Research Collection School Of Computing and Information Systems

Much existing research on blogs focused on posts only, ignoring their comments. Our user study conducted on summarizing blog posts, however, showed that reading comments does change one's understanding about blog posts. In this research, we aim to extract representative sentences from a blog post that best represent the topics discussed among its comments. The proposed solution first derives representative words from comments and then selects sentences containing representative words. The representativeness of words is measured using ReQuT (i.e., Reader, Quotation, and Topic). Evaluated on human labeled sentences, ReQuT together with summation-based sentence selection showed promising results.

Go to article

Model Checking In The Absence Of Code, Model And Properties, David Lo, Siau-Cheng Khoo Nov 2007

Model Checking In The Absence Of Code, Model And Properties, David Lo, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Model checking is a major approach in ensuring software correctness. It verifies a model converted from code against some formal properties. However, difficulties and programmers ’ reluctance to formalize formal properties have been some hurdles to its widespread industrial adoption. Also, with the advent of commercial off-the-shelf (COTS) components provided by third party vendors, model checking is further challenged as often only a binary version of the code is provided by vendors. Interestingly, latest instrumentation tools like PIN and Valgrind have enable execution traces to be collected dynamically from a running program. In this preliminary study, we investigate what can …

Go to article

An Information-Sharing Based Anti-Phishing System, Yueqing Cheng, Zhen Yuan, Lei Ma, Robert H. Deng Nov 2007

An Information-Sharing Based Anti-Phishing System, Yueqing Cheng, Zhen Yuan, Lei Ma, Robert H. Deng

Research Collection School Of Computing and Information Systems

This paper presents the design of an informationsharing based or server-assisted anti-phishing system. The system follows a client-server architecture and makes decision based on not only client side heuristics but also collective information from multiple clients. When visiting a web site, a client side proxy, installed as a plug-in to a browser, decides on the legitimacy of the web site based on a combination of white list, black list and heuristics. In case the client side proxy does not have sufficient information to make a clear judgment, it reports the suspicious site to a central server which has access to …

Go to article

S-Made: Interactive Storytelling Architecture Through Goal Execution And Decomposition, Yundong Cai, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan Nov 2007

S-Made: Interactive Storytelling Architecture Through Goal Execution And Decomposition, Yundong Cai, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Interactive storytelling, emerging with virtual reality technology, has attracted a lot of research interests in recent years. In order to bridge the gap between story generation and story presentation, some hybrid narrative models are raised. In this paper, we propose a new hybrid interactive storytelling architecture S-MADE. It combines the story plot generation and character performance through goal execution and decomposition mechanism. Fuzzy Cognitive Goal Net (FCGN) is a goal modeling tool for modeling the story scenario and character behaviors. The goal decomposition algorithm enables for director agent to dispatch acts to characters easily. With this system, dynamic storylines as …

Go to article

Designing The Market Game For A Commodity Trading Simulation, Shih-Fen Cheng Nov 2007

Designing The Market Game For A Commodity Trading Simulation, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

In this paper, we propose to design a market game that (a) can be used in modeling and studying commodity trading scenarios, and (b) can be used in capturing human traders' behaviors. Specifically, we demonstrate the usefulness of this commodity trading game in a single-commodity futures trading scenario. A pilot experiment was run with a mixture of human traders and an autonomous agent that emulates the aggregatedmarket condition, with the assumption that this autonomous agent would hint each of its action through a public announcement. We show that the information collected from this simulation can be used to extract the …

Go to article

The Price Of Stability In Selfish Scheduling Games, Lucas Agussurja, Hoong Chuin Lau Nov 2007

The Price Of Stability In Selfish Scheduling Games, Lucas Agussurja, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Game theory has gained popularity as an approach to analysing and understanding distributed systems with selfinterested agents. Central to game theory is the concept of Nash equilibrium as a stable state (solution) of the system, which comes with a price - the loss in efficiency. The quantification of the efficiency loss is one of the main research concerns. In this paper, we study the quality and computational characteristic of the best Nash equilibrium in two selfish scheduling models: the congestion model and the sequencing model. In particular, we present the following results: (1) In the congestion model: first, the best …

Go to article

Light-Weight Encryption Schemes For Multimedia Data, Feng Bao, Robert H. Deng Nov 2007

Light-Weight Encryption Schemes For Multimedia Data, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Due to the pervasiveness of high-speed networks and multimedia communications and storage, the demand for highspeed cryptosystems is ever increasing. It is widely believed that there is a tradeoff between speed and security in cryptosystem design. No existing encryption algorithms are both fast enough for high-speed operation and sufficiently secure to withstand powerful cryptanalysis. In this paper, we propose and analyze a generic construction of high-speed encryption schemes. Our solution is based on the fact that there exist secure but relatively slow block ciphers, e. g. AES, and super-fast but relatively weaker stream ciphers. We then combine a secure block …

Go to article

Context-Aware Statistical Debugging: From Bug Predictors To Faulty Control Flow Paths, Lingxiao Jiang, Zhendong Su Nov 2007

Context-Aware Statistical Debugging: From Bug Predictors To Faulty Control Flow Paths, Lingxiao Jiang, Zhendong Su

Research Collection School Of Computing and Information Systems

Effective bug localization is important for realizing automated debugging. One attractive approach is to apply statistical techniques on a collection of evaluation profiles of program properties to help localize bugs. Previous research has proposed various specialized techniques to isolate certain program predicates as bug predictors. However, because many bugs may not be directly associated with these predicates, these techniques are often ineffective in localizing bugs. Relevant control flow paths that may contain bug locations are more informative than stand-alone predicates for discovering and understanding bugs. In this paper, we propose an approach to automatically generate such faulty control flow paths …

Go to article

Modeling Semantics In Composite Web Service Requests By Utility Elicitation, Qianhui Althea Liang, Jen Yao Chung, Steven M. Miller Nov 2007

Modeling Semantics In Composite Web Service Requests By Utility Elicitation, Qianhui Althea Liang, Jen Yao Chung, Steven M. Miller

Research Collection School Of Computing and Information Systems

When meeting the challenges in automatic and semi-automatic Web service composition, capturing the user’s service demand and preferences is as important as knowing what the services can do. This paper discusses the idea of semantic service requests for composite services, and presents a multi-attribute utility theory (MAUT) based model of composite service requests. Service requests are modeled as user preferences and constraints. Two preference structures, additive independence and generalized additive independence, are utilized in calculating the expected utilities of service composition outcomes. The model is also based on an iterative and incremental scheme meant to better capture requirements in accordance …

Go to article

Sloque: Slot-Based Query Expansion For Complex Questions, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang Nov 2007

Sloque: Slot-Based Query Expansion For Complex Questions, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

Searching answers to complex questions is a challenging IR task. In this paper, we examine the use of query templates with semantic slots to formulate slot-based queries. These queries have query terms assigned to entity and relationship slots. We develop several query expansion methods for slot-based queries so as to improve their retrieval effectiveness on a document collection. Each method consists of a combination of term scoring scheme, term scoring formula, and term assignment scheme. Our preliminary experiments evaluate these different slot-based query expansion methods on a collection of news documents,and conclude that:(1) slot-based queries yield better retrieval accuracy compared …

Go to article

Machine-Assisted Proof Support For Validation Beyond Simulink, Chunqing Chen, Jin Song Dong, Jun Sun Nov 2007

Machine-Assisted Proof Support For Validation Beyond Simulink, Chunqing Chen, Jin Song Dong, Jun Sun

Research Collection School Of Computing and Information Systems

Simulink is popular in industry for modeling and simulating embedded systems. It is deficient to handle requirements of high-level assurance and timing analysis. Previously, we showed the idea of applying Timed Interval Calculus (TIC) to complement Simulink. In this paper, we develop machine-assisted proof support for Simulink models represented in TIC. The work is based on a generic theorem prover, Prototype Verification System (PVS). The TIC specifications of both Simulink models and requirements are transformed to PVS specifications automatically. Verification can be carried out at interval level with a high level of automation. Analysis of continuous and discrete behaviors is …

Go to article

Advances And Challenges With Data Broadcasting In Wireless Mesh Networks, Chun Tung Chou, Junaid Qadir, Joo Ghee Lim, Archan Misra Nov 2007

Advances And Challenges With Data Broadcasting In Wireless Mesh Networks, Chun Tung Chou, Junaid Qadir, Joo Ghee Lim, Archan Misra

Research Collection School Of Computing and Information Systems

Wireless mesh networks have become a promising means to provide low-cost broadband access. Many WMN applications require broadcasting data (IPTV etc.) over the WMN. This article studies how efficient data broadcast, measured in terms of broadcast latency, can be realized by exploiting two features of WMNs: the use of multiple transmission rates at the link layer and the use of multiple radio interfaces on each node. We demonstrate that by exploiting these features, broadcast latency can be reduced severalfold compared to the current default practice in wireless LANs of using the lowest transmission rate for broadcast traffic. We also discuss …

Go to article

Multi-Period Combinatorial Auction Mechanism For Distributed Resource Allocation And Scheduling, Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, Jong Han Park, Zhengyi Zhao Nov 2007

Multi-Period Combinatorial Auction Mechanism For Distributed Resource Allocation And Scheduling, Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, Jong Han Park, Zhengyi Zhao

Research Collection School Of Computing and Information Systems

We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resources from a central resource pool to be allocated to distributed decision makers (agents) that seek to optimize their respective scheduling goals. We propose a generic combinatorial auction mechanism that allows agents to competitively bid for the resources needed in a multi-period setting, regardless of the respective scheduling problem faced by the agent, and show how agents can design optimal bidding strategies to respond to price adjustment strategies from the auctioneer. We apply our …

Go to article

Mining Modal Scenarios-Based Specifications From Execution Trace Of Reactive Systems, David Lo, Shahar Maoz, Siau-Cheng Khoo Nov 2007

Mining Modal Scenarios-Based Specifications From Execution Trace Of Reactive Systems, David Lo, Shahar Maoz, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Specification mining is a dynamic analysis process aimed at automatically inferring suggested specifications of a program from its execution traces. We describe a novel method, framework, and tool, for mining inter-object scenario-based specifications in the form of a UML2-compliant variant of Damm and Harels Live Sequence Charts (LSC). LSC extends the classical partial order semantics of sequence diagrams with temporal liveness and symbolic class level lifelines, in order to generate compact and expressive specifications. The output of our algorithm is a sound and complete set of statistically significant LSCs (i.e., satisfying given thresholds of support and confidence), mined from an …

Go to article

On Improving Wikipedia Search Using Article Quality, Meiqun Hu, Ee Peng Lim, Aixin Sun, Hady Wirawan Lauw, Ba-Quy Vuong Nov 2007

On Improving Wikipedia Search Using Article Quality, Meiqun Hu, Ee Peng Lim, Aixin Sun, Hady Wirawan Lauw, Ba-Quy Vuong

Research Collection School Of Computing and Information Systems

Wikipedia is presently the largest free-and-open online encyclopedia collaboratively edited and maintained by volunteers. While Wikipedia offers full-text search to its users, the accuracy of its relevance-based search can be compromised by poor quality articles edited by non-experts and inexperienced contributors. In this paper, we propose a framework that re-ranks Wikipedia search results considering article quality. We develop two quality measurement models, namely Basic and PeerReview, to derive article quality based on co-authoring data gathered from articles' edit history. Compared with Wikipedia's full-text search engine, Google and Wikiseek, our experimental results showed that (i) quality-only ranking produced by PeerReview gives …

Go to article

Measuring Article Quality In Wikipedia: Models And Evaluation, Meiqun Hu, Ee Peng Lim, Aixin Sun, Hady W. Lauw, Ba-Quy Vuong Nov 2007

Measuring Article Quality In Wikipedia: Models And Evaluation, Meiqun Hu, Ee Peng Lim, Aixin Sun, Hady W. Lauw, Ba-Quy Vuong

Research Collection School Of Computing and Information Systems

Wikipedia has grown to be the world largest and busiest free encyclopedia, in which articles are collaboratively written and maintained by volunteers online. Despite its success as a means of knowledge sharing and collaboration, the public has never stopped criticizing the quality of Wikipedia articles edited by non-experts and inexperienced contributors. In this paper, we investigate the problem of assessing the quality of articles in collaborative authoring of Wikipedia. We propose three article quality measurement models that make use of the interaction data between articles and their contributors derived from the article edit history. Our Basic model is designed based …

Go to article

A Two-Phase Approach To Interactivity Enhancement For Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou Oct 2007

A Two-Phase Approach To Interactivity Enhancement For Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou

Research Collection School Of Computing and Information Systems

Distributed virtual environments (DVEs) are distributed systems that allow multiple geographically distributed clients (users) to interact simultaneously in a computer-generated, shared virtual world. Applications of DVEs can be seen in many areas nowadays, such as online games, military simulations, collaborative designs, etc. To support large-scale DVEs with real-time interactions among thousands or even more distributed clients, a geographically distributed server architecture (GDSA) is generally needed, and the virtual world can be partitioned into many distinct zones to distribute the load among the servers. Due to the geographic distributions of clients and servers in such architectures, it is essential to efficiently …

Go to article

Performance Of Network-Coding In Multi-Rate Wireless Environments For Multicast Applications, Luiz F. M. Viera, Archan Misra, Mario Gerla Oct 2007

Performance Of Network-Coding In Multi-Rate Wireless Environments For Multicast Applications, Luiz F. M. Viera, Archan Misra, Mario Gerla

Research Collection School Of Computing and Information Systems

This paper investigates the interaction between net-work coding and link-layer transmission rate diversity in multi-hop wireless networks. By appropriately mixing data packets at intermediate nodes, network coding allows a single multicast flow to achieve higher throughput to a set of receivers. Broadcast applications can also exploit link-layer rate diversity, whereby individual nodes can transmit at faster rates at the expense of corresponding smaller coverage area. We first demonstrate how combining rate-diversity with network coding can provide a larger capacity for data dissemination of a single multicast flow, and how consideration of rate diversity is critical for maximizing system throughput. We …

Go to article

Gapprox: Mining Frequent Approximate Patterns From A Massive Network, Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han Oct 2007

Gapprox: Mining Frequent Approximate Patterns From A Massive Network, Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han

Research Collection School Of Computing and Information Systems

Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, demanding powerful data mining methods. Due to inherent noise or data diversity, it is crucial to address the issue of approximation, if one wants to mine patterns that are potentially interesting with tolerable variations. In this paper, we investigate the problem of mining frequent approximate patterns from a massive network and propose a method called gApprox. gApprox not only finds approximate network patterns, which is the key for many knowledge discovery applications on …

Go to article

Next Last