Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (157)
- Databases and Information Systems (62)
- Software Engineering (34)
- Numerical Analysis and Scientific Computing (27)
- Business (21)
-
- Engineering (17)
- Information Security (15)
- Graphics and Human Computer Interfaces (13)
- Artificial Intelligence and Robotics (12)
- Management Information Systems (12)
- Computer Engineering (9)
- Operations Research, Systems Engineering and Industrial Engineering (8)
- Social and Behavioral Sciences (8)
- Data Storage Systems (7)
- OS and Networks (6)
- Communication (5)
- Programming Languages and Compilers (5)
- Theory and Algorithms (5)
- E-Commerce (4)
- Social Media (3)
- Communication Technology and New Media (2)
- Education (2)
- Public Affairs, Public Policy and Public Administration (2)
- Asian Studies (1)
- Defense and Security Studies (1)
- Digital Communications and Networking (1)
- Economics (1)
- Finance and Financial Management (1)
- Growth and Development (1)
- Keyword
-
- Algorithms (6)
- Blog (3)
- Model Check (3)
- Near-duplicate keyframe (3)
- Performance (3)
-
- Animation (2)
- Blog classification (2)
- Blog profiling (2)
- Concept-based video search (2)
- Entry selection (2)
- Experimentation (2)
- Image copy detection (2)
- Image retrieval (2)
- Linear Temporal Logic (2)
- Nonrigid image matching (2)
- Online community (2)
- Ontology (2)
- Popular queries (2)
- Query processing (2)
- Reinforcement learning (2)
- Remote attestation (2)
- Routing (2)
- Search results (2)
- Semi-supervised learning (2)
- Social tagging (2)
- Spatial databases (2)
- Supervised learning (2)
- Support vector machines (2)
- Trusted computing (2)
- Visual relatedness (2)
Articles 61 - 90 of 158
Full-Text Articles in Physical Sciences and Mathematics
Generating Robust Schedules Subject To Resource And Duration Uncertainties, Na Fu, Hoong Chuin Lau, Fei Xiao
Generating Robust Schedules Subject To Resource And Duration Uncertainties, Na Fu, Hoong Chuin Lau, Fei Xiao
Research Collection School Of Computing and Information Systems
We consider the Resource-Constrained Project Scheduling Problem with minimal and maximal time lags under resource and duration uncertainties. To manage resource uncertainties, we build upon the work of Lambrechts et al 2007 and develop a method to analyze the effect of resource breakdowns on activity durations. We then extend the robust local search framework of Lau et al 2007 with additional considerations on the impact of unexpected resource breakdowns to the project makespan, so that partial order schedules (POS) can absorb both resource and duration uncertainties. Experiments show that our proposed model is capable of addressing the uncertainty of resources, …
An Efficient Pir Construction Using Trusted Hardware, Yanjiang Yang, Xuhua Ding, Robert H. Deng, Feng Bao
An Efficient Pir Construction Using Trusted Hardware, Yanjiang Yang, Xuhua Ding, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
For a private information retrieval (PIR) scheme to be deployed in practice, low communication complexity and low computation complexity are two fundamental requirements it must meet. Most existing PIR schemes only focus on the communication complexity. The reduction on the computational complexity did not receive the due treatment mainly because of its O(n) lower bound. By using the trusted hardware based model, we design a novel scheme which breaks this barrier. With constant storage, the computation complexity of our scheme, including offline computation, is linear to the number of queries and is bounded by after optimization.
A Heuristic Method For Job-Shop Scheduling With An Infinite Wait Buffer: From One-Machine To Multi-Machine Problems, Z. J. Zhao, J. Kim, M. Luo, Hoong Chuin Lau, S. S. Ge
A Heuristic Method For Job-Shop Scheduling With An Infinite Wait Buffer: From One-Machine To Multi-Machine Problems, Z. J. Zhao, J. Kim, M. Luo, Hoong Chuin Lau, S. S. Ge
Research Collection School Of Computing and Information Systems
Through empirical comparison of classical job shop problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimization Micro-model (IMM) heuristic method with the mixed integer programming (MIP) solution by CPLEX. For multi-machine problems, the IMM heuristic method is faster and achieves a better solution. Finally, for a large problem instance with 409 jobs and 30 types of machines, IMM-heuristic method is compared with ProModel and we find that the heuristic method is slightly …
Tuning Into The Digital Channel: Evaluating Business Model Fit For Internet Firm Survival, Robert J. Kauffman, Bin Wang
Tuning Into The Digital Channel: Evaluating Business Model Fit For Internet Firm Survival, Robert J. Kauffman, Bin Wang
Research Collection School Of Computing and Information Systems
More than 5,000 Internet firms have failed since the beginning of 2000. One common perception is that the downturn in the economy drove many firms out of business. But then, why have some firms survived? In this research, we provide an empirical analysis by examining how the business model characteristics of an Internet firm affect its survival. We analyze a panel data set of 130 public Internet firms using two different techniques: non-parametric survival analysis, and the semiparametric Cox proportional hazards model. We characterize the survival rates throughout the lifetimes of the public Internet firms in our sample. Our results …
Distinguishing Between Fe And Ddos Using Randomness Check, Hyundo Park, Peng Li, Debin Gao, Heejo Lee, Robert H. Deng
Distinguishing Between Fe And Ddos Using Randomness Check, Hyundo Park, Peng Li, Debin Gao, Heejo Lee, Robert H. Deng
Research Collection School Of Computing and Information Systems
Threads posed by Distributed Denial of Service (DDoS) attacks are becoming more serious day by day. Accurately detecting DDoS becomes an important and necessary step in securing a computer network. However, Flash Event (FE), which is created by legitimate requests, shares very similar characteristics with DDoS in many aspects and makes it hard to be distinguished from DDoS attacks. In this paper, we propose a simple yet effective mechanism called FDD (FE and DDoS Distinguisher) to distinguish FE and DDoS. To the best of our knowledge, this is the first effective and practical mechanism that distinguishes FE and DDoS attacks. …
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.
Cascade Rsvm In Peer-To-Peer Network, Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng
Cascade Rsvm In Peer-To-Peer Network, Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng
Research Collection School Of Computing and Information Systems
The goal of distributed learning in P2P networks is to achieve results as close as possible to those from centralized approaches. Learning models of classification in a P2P network faces several challenges like scalability, peer dynamism, asynchronism and data privacy preservation. In this paper, we study the feasibility of building SVM classifiers in a P2P network. We show how cascading SVM can be mapped to a P2P network of data propagation. Our proposed P2P SVM provides a method for constructing classifiers in P2P networks with classification accuracy comparable to centralized classifiers and better than other distributed classifiers. The proposed algorithm …
Software Nightmares, Manoj Thulasidas
Software Nightmares, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
To err is human, but to really foul things up, you need a computer. So states the remarkably insightful Murphy’s Law. And nowhere else does this ring truer than in our financial workplace. After all, it is the financial sector that drove the rapid progress in the computing industry – which is why the first computing giant had the word “business” in its name. The financial industry keeps up with the developments in the computer industry for one simple reason. Stronger computers and smarter programs mean more money — a concept we readily grasp. As we use the latest and …
The Pricing Strategy Analysis For The Software-As-A-Service Business Model, Dan Ma, Abraham Seidmann
The Pricing Strategy Analysis For The Software-As-A-Service Business Model, Dan Ma, Abraham Seidmann
Research Collection School Of Computing and Information Systems
The Software-as-a-Service (SaaS) model is a novel way of delivering software applications. In this paper, we present an analytical model to study the competition between the SaaS and the traditional COTS (Commercial off-the-shelf) software. The main research goal is to analyze the pricing strategy of the SaaS in a competitive setting. The model captures the most salient differences between the SaaS and COTS, including their distinct pricing structures, user initial setup costs, system customization levels, and delivery channels. We find that the two could coexist in a competitive market in the long run, and more importantly, we show how the …
Knowledge Transfer Via Multiple Model Local Structure Mapping, Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
Knowledge Transfer Via Multiple Model Local Structure Mapping, Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
Research Collection School Of Computing and Information Systems
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from which test examples are to be drawn. The task can be especially difficult when the training examples are from one or several domains different from the test domain. In this paper, we propose a locally weighted ensemble framework to combine multiple models for transfer learning, where the weights are dynamically assigned according to a model's predictive power on each test example. It can integrate the advantages of various learning algorithms and the labeled information from multiple …
Mining Patterns And Rules For Software Specification Discovery, David Lo, Siau-Cheng Khoo
Mining Patterns And Rules For Software Specification Discovery, David Lo, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Software specifications are often lacking, incomplete and outdated in the industry. Lack and incomplete specifications cause various software engineering problems. Studies have shown that program comprehension takes up to 45% of software development costs. One of the root causes of the high cost is the lack-of documented specification. Also, outdated and incomplete specification might potentially cause bugs and compatibility issues. In this paper, we describe novel data mining techniques to mine or reverse engineer these specifications from the pool of software engineering data. A large amount of software data is available for analysis. One form of software data is program …
Hierarchical Inter-Object Traces For Specification Mining, David Lo, Shahar Maoz
Hierarchical Inter-Object Traces For Specification Mining, David Lo, Shahar Maoz
Research Collection School Of Computing and Information Systems
Major challenges of dynamic analysis approaches to specification mining include scalability over long traces as well as comprehensibility and expressivity of results. We present a novel use of object hierarchies over inter-object traces as an abstraction/refinement mechanism enabling scalable, incremental, top-down mining of scenario-based specifications.
Authenticating The Query Results Of Text Search Engines, Hwee Hwa Pang, Kyriakos Mouratidis
Authenticating The Query Results Of Text Search Engines, Hwee Hwa Pang, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
The number of successful attacks on the Internet shows that it is very difficult to guarantee the security of online search engines. A breached server that is not detected in time may return incorrect results to the users. To prevent that, we introduce a methodology for generating an integrity proof for each search result. Our solution is targeted at search engines that perform similarity-based document retrieval, and utilize an inverted list implementation (as most search engines do). We formulate the properties that define a correct result, map the task of processing a text search query to adaptations of existing threshold-based …
Learning Outcomes For A Business Information Systems Undergraduate Program, Joelle Elmaleh, Steven Miller, Paul S. Goodman
Learning Outcomes For A Business Information Systems Undergraduate Program, Joelle Elmaleh, Steven Miller, Paul S. Goodman
Research Collection School Of Computing and Information Systems
We present a learning outcomes framework for an Information Systems (IS) undergraduate program. This framework includes a supporting software application that goes beyond any other attempt reported to date to integrate learning outcomes into program-wide and course-wide curriculum development, ongoing curriculum redesign, and student learning support. The Learning Outcomes Management System (LOMS) described here is a first-of-a-kind information system created as part of implementing a program-wide learning outcomes framework in a university setting. Our learning outcomes framework is distinct in that 1) it is based on a three-level hierarchically structured definition of learning outcomes that consistently apply to both the …
A Lightweight Buyer-Seller Watermarking Protocol, Yongdong Wu, Hwee Hwa Pang
A Lightweight Buyer-Seller Watermarking Protocol, Yongdong Wu, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
The buyer-seller watermarking protocol enables a seller to successfully identify a traitor from a pirated copy, while preventing the seller from framing an innocent buyer. Based on finite field theory and the homomorphic property of public key cryptosystems such as RSA, several buyer-seller watermarking protocols (N. Memon and P. W. Wong (2001) and C.-L. Lei et al. (2004)) have been proposed previously. However, those protocols require not only large computational power but also substantial network bandwidth. In this paper, we introduce a new buyer-seller protocol that overcomes those weaknesses by managing the watermarks. Compared with the earlier protocols, ours is …
Relationship Preserving Auction For Repeated E-Procurement, Park J., Lee J., Lau H.
Relationship Preserving Auction For Repeated E-Procurement, Park J., Lee J., Lau H.
Research Collection School Of Computing and Information Systems
While e-procurement auction has helped firms to achieve lower procurement costs, auction mechanisms that prevail at present in procurement markets need to address an important issue that concerns the ability to maintain long term relationships with the partners, especially in repeated e-procurement settings. In this paper, we propose a Relationship Preserving Auction (RPA) mechanism that augments the conventional auction mechanism with a bidder relationship scoring model. Our proposed mechanism gives increased chances of winning to the bidders who have bidden at relatively competitive price but had comparatively less wins so far. Keeping these bidders in the auction over time will …
Classification In P2p Networks By Bagging Cascade Rsvms, Hock Hee Ang, Vikvekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng, Anwitaman Datta
Classification In P2p Networks By Bagging Cascade Rsvms, Hock Hee Ang, Vikvekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng, Anwitaman Datta
Research Collection School Of Computing and Information Systems
Data mining tasks in P2P are bound by issues like scalability, peer dynamism, asynchronism, and data privacy preservation. These challenges pose difficulties for deploying conventional machine learning techniques in P2P networks, which may be hard to achieve classification accuracies comparable to regular centralized solutions. We recently investigated the classification problem in P2P networks and proposed a novel P2P classification approach by cascading Reduced Support Vector Machines (RSVM). Although promising results were obtained, the existing solution has some drawback of redundancy in both communication and computation. In this paper, we present a new approach to over the limitation of the previous …
Simulating A Smartboard By Real-Time Gesture Detection In Lecture Videos, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
Simulating A Smartboard By Real-Time Gesture Detection In Lecture Videos, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
Research Collection School Of Computing and Information Systems
Gesture plays an important role for recognizing lecture activities in video content analysis. In this paper, we propose a real-time gesture detection algorithm by integrating cues from visual, speech and electronic slides. In contrast to the conventional "complete gesture" recognition, we emphasize detection by the prediction from "incomplete gesture". Specifically, intentional gestures are predicted by the modified hidden Markov model (HMM) which can recognize incomplete gestures before the whole gesture paths are observed. The multimodal correspondence between speech and gesture is exploited to increase the accuracy and responsiveness of gesture detection. In lecture presentation, this algorithm enables the on-the-fly editing …
Mapping The Multi-Tiered Impacts Of The Growth Of It Industries In India: A Combined Scale-And-Scope Externalities Perspective, Robert J. Kauffman, Ajay Kumar
Mapping The Multi-Tiered Impacts Of The Growth Of It Industries In India: A Combined Scale-And-Scope Externalities Perspective, Robert J. Kauffman, Ajay Kumar
Research Collection School Of Computing and Information Systems
Externalities occur among agglomerated firms. Scale externalities occur between firms in the same industry. Scope externalities occur when heterogeneous industries are collocated. Combined scale-and-scope externalities exist when the scale of one industry is beneficial to the growth of another collocated industry. In the Sein and Haridranath (2004) framework of information technology (IT) impacts on development, scale externalities correspond to second-order impacts, while combined scale and scope eternalities correspond to third-order impacts. We use an agglomeration perspective to explain the growth of IT industries in India. We study growth patterns of four specific IT industries: computer and peripheral equipment manufacturing, semiconductor …
User Guidance Of Resource-Adaptive Systems, João Pedro Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan
User Guidance Of Resource-Adaptive Systems, João Pedro Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan
Research Collection School Of Computing and Information Systems
This paper presents a framework for engineering resource-adaptive software systems targeted at small mobile devices. The proposed framework empowers users to control tradeoffs among a rich set of ervicespecific aspects of quality of service. After motivating the problem, the paper proposes a model for capturing user preferences with respect to quality of service, and illustrates prototype user interfaces to elicit such models. The paper then describes the extensions and integration work made to accommodate the proposed framework on top of an existing software infrastructure for ubiquitous computing. The research question addressed here is the feasibility of coordinating resource allocation and …
Comments-Oriented Document Summarization: Understanding Documents With Readers' Feedback, Meishan Hu, Aixin Sun, Ee Peng Lim
Comments-Oriented Document Summarization: Understanding Documents With Readers' Feedback, Meishan Hu, Aixin Sun, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Comments left by readers on Web documents contain valuable information that can be utilized in different information retrieval tasks including document search, visualization, and summarization. In this paper, we study the problem of comments-oriented document summarization and aim to summarize a Web document (e.g., a blog post) by considering not only its content, but also the comments left by its readers. We identify three relations (namely, topic, quotation, and mention) by which comments can be linked to one another, and model the relations in three graphs. The importance of each comment is then scored by: (i) graph-based method, where the …
Searching Correlated Objects In A Long Sequence, Ken C. K. Lee, Wang-Chien Lee, Donna Peuquet, Baihua Zheng
Searching Correlated Objects In A Long Sequence, Ken C. K. Lee, Wang-Chien Lee, Donna Peuquet, Baihua Zheng
Research Collection School Of Computing and Information Systems
Sequence, widely appearing in various applications (e.g. event logs, text documents, etc) is an ordered list of objects. Exploring correlated objects in a sequence can provide useful knowledge among the objects, e.g., event causality in event log and word phrases in documents. In this paper, we introduce correlation query that finds correlated pairs of objects often appearing closely to each other in a given sequence. A correlation query is specified by two control parameters, distance bound, the requirement of object closeness, and correlation threshold, the minimum requirement of correlation strength of result pairs. Instead of processing the query by scanning …
Empirical Analysis Of Certificate Revocation Lists, Daryl Walleck, Yingjiu Li, Shouhuai Xu
Empirical Analysis Of Certificate Revocation Lists, Daryl Walleck, Yingjiu Li, Shouhuai Xu
Research Collection School Of Computing and Information Systems
Managing public key certificates revocation has long been a central issue in public key infrastructures. Though various certificate revocation mechanisms have been proposed to address this issue, little effort has been devoted to the empirical analysis of real-world certificate revocation data. In this paper, we conduct such an empirical analysis based on a large amount of data collected from VeriSign. Our study enables us to understand how long a revoked certificate lives and what the difference is in the lifetime of revoked certificates by certificate types, geographic locations, and organizations. Our study also provides a solid foundation for future research …
Mining Temporal Rules For Software Maintenance, David Lo, Siau-Cheng Khoo, Chao Liu
Mining Temporal Rules For Software Maintenance, David Lo, Siau-Cheng Khoo, Chao Liu
Research Collection School Of Computing and Information Systems
Software evolution incurs difficulties in program comprehension and software verification, and hence it increases the cost of software maintenance. In this study, we propose a novel technique to mine from program execution traces a sound and complete set of statistically significant temporal rules of arbitrary lengths. The extracted temporal rules reveal invariants that the program observes, and will consequently guide developers to understand the program behaviors, and facilitate all downstream applications such as verification and debugging. Different from previous studies that were restricted to mining two-event rules (e.g., (lock) →(unlock)), our algorithm discovers rules of arbitrary lengths. In order to …
Tree-Based Partition Querying: A Methodology For Computing Medoids In Large Spatial Datasets, Kyriakos Mouratidis, Dimitris Papadias, Spiros Papadimitriou
Tree-Based Partition Querying: A Methodology For Computing Medoids In Large Spatial Datasets, Kyriakos Mouratidis, Dimitris Papadias, Spiros Papadimitriou
Research Collection School Of Computing and Information Systems
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous emerging fields, such as location based services and sensor networks. Since the k-medoid problem is NP hard, all existing work deals with approximate solutions on relatively small datasets. This paper aims at efficient methods for very large spatial databases, motivated by: (i) the high and ever increasing availability of spatial data, and (ii) the need for novel query types and improved services. The proposed solutions exploit the intrinsic grouping properties of a data partition index in order …
Spreadsheet Modeling Of Equipment Acquisition Plan, Thin Yin Leong, Michelle L. F. Cheong
Spreadsheet Modeling Of Equipment Acquisition Plan, Thin Yin Leong, Michelle L. F. Cheong
Research Collection School Of Computing and Information Systems
Excel spreadsheets have been used in many classrooms to teach modeling and analysis of real business problems. This can be done with relative ease but often the modeling approach may be inappropriate and the analysis results not easily implemented. In this article, we illustrate these difficulties with the modeling of the number of equipment required in future years, given demand (historical and projected) and the amount of equipment held. We show how the desired output can be, and needs to be related to the given input. For this purpose, we apply the TREND function to predict data into future years. …
H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings
H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings
Research Collection School Of Computing and Information Systems
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together in fewer messages, which produce much less networking overhead than search. Nevertheless, these messages are exponential in size. The basic DPOP always communicates all possible assignments, even when some of them may be inconsistent due to hard constraints. Many real problems contain hard constraints that significantly reduce the space of feasible assignments. This paper introduces H-DPOP, a hybrid algorithm that is based on DPOP, which uses Constraint Decision Diagrams (CDD) to rule out infeasible assignments, and thus compactly …
Mining Past-Time Temporal Rules From Execution Traces, David Lo, Siau-Cheng Khoo, Chao Liu
Mining Past-Time Temporal Rules From Execution Traces, David Lo, Siau-Cheng Khoo, Chao Liu
Research Collection School Of Computing and Information Systems
Specification mining is a process of extracting specifications, often from program execution traces. These specifications can in turn be used to aid program understanding, monitoring and verification. There are a number of dynamic-analysis-based specification mining tools in the literature, however none so far extract past time temporal expressions in the form of rules stating: whenever a series of events occurs, previously another series of events has happened. Rules of this format are commonly found in practice and useful for various purposes. Most rule-based specification mining tools only mine future-time temporal expression. Many past-time temporal rules like whenever a resource is …
Semi-Supervised Ensemble Ranking, Steven C. H. Hoi, Rong Jin
Semi-Supervised Ensemble Ranking, Steven C. H. Hoi, Rong Jin
Research Collection School Of Computing and Information Systems
Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance by combining the outputs from multiple ranking algorithms. Many ensemble ranking approaches employ supervised learning techniques to learn appropriate weights for combining multiple rankers. The main shortcoming with these approaches is that the learned weights for ranking algorithms are query independent. This is suboptimal since a ranking algorithm could perform well for certain queries but poorly for others. In this paper, we propose a novel semi-supervised ensemble ranking (SSER) algorithm that learns query-dependent weights when combining …
Searching Blogs And News: A Study On Popular Queries, Aixin Sun, Meishan Hu, Ee Peng Lim
Searching Blogs And News: A Study On Popular Queries, Aixin Sun, Meishan Hu, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Blog/news search engines are very important channels to reach information about the real-time happenings. In this paper, we study the popular queries collected over one year period and compare their search results returned by a blog search engine (i.e., Technorati) and a news search engine (i.e., Google News). We observed that the numbers of hits returned by the two search engines for the same set of queries were highly correlated, suggesting that blogs often provide commentary to current events reported in news. As many popular queries are related to some events, we further observed a high cohesiveness among the returned …