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

Physical Sciences and Mathematics Commons

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

Databases and Information Systems

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 4621 - 4650 of 6727

Full-Text Articles in Physical Sciences and Mathematics

Using Social Annotations For Trend Discovery In Scientific Publications, Meiqun Hu, Ee Peng Lim, Jing Jiang Oct 2011

Using Social Annotations For Trend Discovery In Scientific Publications, Meiqun Hu, Ee Peng Lim, Jing Jiang

Research Collection School Of Computing and Information Systems

Social tags and citing documents are two forms of social annotations to scientific publications. These social annotations provide useful contextual and temporal information for the annotated work, which encapsulates the attention and interest of the annotators. In this work, we explore the use of social annotations for discovering trends in scientific publications. We propose a trend discovery process that employs trend estimation and trend selection and ranking for analyzing the emerging trends shown in the social annotation profiles. The proposed sigmoid trend estimator allows us to characterize and compare how much, when and how fast the trends emerge. To perform …


Cooperative Reinforcement Learning In Topology-Based Multi-Agent Systems, Dan Xiao, Ah-Hwee Tan Oct 2011

Cooperative Reinforcement Learning In Topology-Based Multi-Agent Systems, Dan Xiao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Topology-based multi-agent systems (TMAS), wherein agents interact with one another according to their spatial relationship in a network, are well suited for problems with topological constraints. In a TMAS system, however, each agent may have a different state space, which can be rather large. Consequently, traditional approaches to multi-agent cooperative learning may not be able to scale up with the complexity of the network topology. In this paper, we propose a cooperative learning strategy, under which autonomous agents are assembled in a binary tree formation (BTF). By constraining the interaction between agents, we effectively unify the state space of individual …


Mining Direct Antagonistic Communities In Explicit Trust Networks, David Lo, Didi Surian, Zhang Kuan, Ee Peng Lim Oct 2011

Mining Direct Antagonistic Communities In Explicit Trust Networks, David Lo, Didi Surian, Zhang Kuan, Ee Peng Lim

Research Collection School Of Computing and Information Systems

There has been a recent increase of interest in analyzing trust and friendship networks to gain insights about relationship dynamics among users. Many sites such as Epinions, Facebook, and other social networking sites allow users to declare trusts or friendships between different members of the community. In this work, we are interested in extracting direct antagonistic communities (DACs) within a rich trust network involving trusts and distrusts. Each DAC is formed by two subcommunities with trust relationships among members of each sub-community but distrust relationships across the sub-communities. We develop an efficient algorithm that could analyze large trust networks leveraging …


Active Multiple Kernel Learning For Interactive 3d Object Retrieval Systems, Steven C. H. Hoi, Rong Jin Oct 2011

Active Multiple Kernel Learning For Interactive 3d Object Retrieval Systems, Steven C. H. Hoi, Rong Jin

Research Collection School Of Computing and Information Systems

An effective relevance feedback solution plays a key role in interactive intelligent 3D object retrieval systems. In this work, we investigate the relevance feedback problem for interactive intelligent 3D object retrieval, with the focus on studying effective machine learning algorithms for improving the user's interaction in the retrieval task. One of the key challenges is to learn appropriate kernel similarity measure between 3D objects through the relevance feedback interaction with users. We address this challenge by presenting a novel framework of Active multiple kernel learning (AMKL), which exploits multiple kernel learning techniques for relevance feedback in interactive 3D object retrieval. …


On Modeling Virality Of Twitter Content, Tuan Anh Hoang, Ee Peng Lim, Palakorn Achananuparp, Jing Jiang, Feida Zhu Oct 2011

On Modeling Virality Of Twitter Content, Tuan Anh Hoang, Ee Peng Lim, Palakorn Achananuparp, Jing Jiang, Feida Zhu

Research Collection School Of Computing and Information Systems

Twitter is a popular microblogging site where users can easily use mobile phones or desktop machines to generate short messages to be shared with others in realtime. Twitter has seen heavy usage in many recent international events including Japan earthquake, Iran election, etc. In such events, many tweets may become viral for different reasons. In this paper, we study the virality of socio-political tweet content in the Singapore’s 2011 general election (GE2011). We collected tweet data generated by about 20K Singapore users from 1 April 2011 till 12 May 2011, and the follow relationships among them. We introduce several quantitative …


Location-Dependent Spatial Query Containment, Ken C. K. Lee, Brandon Unger, Baihua Zheng, Wang-Chien Lee Oct 2011

Location-Dependent Spatial Query Containment, Ken C. K. Lee, Brandon Unger, Baihua Zheng, Wang-Chien Lee

Research Collection School Of Computing and Information Systems

Nowadays, location-related information is highly accessible to mobile users via issuing Location-Dependent Spatial Queries (LDSQs) with respect to their locations wirelessly to Location-Based Service (LBS) servers. Due to the limited mobile device battery energy, scarce wireless bandwidth, and heavy LBS server workload, the number of LDSQs submitted over wireless channels to LBS servers for evaluation should be minimized as appropriate. In this paper, we exploit query containment techniques for LDSQs (called LDSQ containment) to enable mobile clients to determine whether the result of a new LDSQ Q′ is completely covered by that of another LDSQ Q previously answered by a …


Collaborative Online Learning Of User Generated Content, Guangxia Li, Kuiyu Chang, Steven C. H. Hoi, Wenting Liu, Ramesh Jain Oct 2011

Collaborative Online Learning Of User Generated Content, Guangxia Li, Kuiyu Chang, Steven C. H. Hoi, Wenting Liu, Ramesh Jain

Research Collection School Of Computing and Information Systems

We study the problem of online classification of user generated content, with the goal of efficiently learning to categorize content generated by individual user. This problem is challenging due to several reasons. First, the huge amount of user generated content demands a highly efficient and scalable classification solution. Second, the categories are typically highly imbalanced, i.e., the number of samples from a particular useful class could be far and few between compared to some others (majority class). In some applications like spam detection, identification of the minority class often has significantly greater value than that of the majority class. Last …


Direction-Based Surrounder Queries For Mobile Recommendations, Xi Guo, Baihua Zheng, Yoshiharu Ishikawa, Yunjun Gao Oct 2011

Direction-Based Surrounder Queries For Mobile Recommendations, Xi Guo, Baihua Zheng, Yoshiharu Ishikawa, Yunjun Gao

Research Collection School Of Computing and Information Systems

Location-based recommendation services recommend objects to the user based on the user’s preferences. In general, the nearest objects are good choices considering their spatial proximity to the user. However, not only the distance of an object to the user but also their directional relationship are important. Motivated by these, we propose a new spatial query, namely a direction-based surrounder (DBS) query, which retrieves the nearest objects around the user from different directions. We define the DBS query not only in a two-dimensional Euclidean space E">EE but also in a road network R">RR . In the Euclidean space E" …


Context-Aware Nearest Neighbor Query On Social Networks, Yazhe Wang, Baihua Zheng Oct 2011

Context-Aware Nearest Neighbor Query On Social Networks, Yazhe Wang, Baihua Zheng

Research Collection School Of Computing and Information Systems

Social networking has grown rapidly over the last few years, and social networks contain a huge amount of content. However, it can be not easy to navigate the social networks to find specific information. In this paper, we define a new type of queries, namely context-aware nearest neighbor (CANN) search over social network to retrieve the nearest node to the query node that matches the context specified. CANN considers both the structure of the social network, and the profile information of the nodes. We design ahyper-graph based index structure to support approximated CANN search efficiently.


The Niddk Central Repository At 8 Years—Ambition, Revision, Use And Impact, Charles F. Turner, Huaqin Pan, Gregg W. Silk, Mary-Anne Ardini, Vesselina Bakalov, Stephanie Bryant, Susanna Cantor, Kung-Yen Chang, Michael Delatte, Paul Eggers, Laxminarayana Ganapathi, Sujatha Lakshmikanthan, Joshua Levy, Sheping Li, Joseph Pratt, Norma Pugh, Ying Qin, Rebekah Rasooly, Helen Ray, Jean E. Richardson, Amanda Flynn Riley, Susan M. Rogers, Charlotte Scheper, Sylvia Tan, Stacie White, Philip C. Cooley Sep 2011

The Niddk Central Repository At 8 Years—Ambition, Revision, Use And Impact, Charles F. Turner, Huaqin Pan, Gregg W. Silk, Mary-Anne Ardini, Vesselina Bakalov, Stephanie Bryant, Susanna Cantor, Kung-Yen Chang, Michael Delatte, Paul Eggers, Laxminarayana Ganapathi, Sujatha Lakshmikanthan, Joshua Levy, Sheping Li, Joseph Pratt, Norma Pugh, Ying Qin, Rebekah Rasooly, Helen Ray, Jean E. Richardson, Amanda Flynn Riley, Susan M. Rogers, Charlotte Scheper, Sylvia Tan, Stacie White, Philip C. Cooley

Publications and Research

The National Institute of Diabetes and Digestive and Kidney Diseases (NIDDK) Central Repository makes data and biospecimens from NIDDK-funded research available to the broader scientific community. It thereby facilitates: the testing of new hypotheses without new data or biospecimen collection; pooling data across several studies to increase statistical power; and informative genetic analyses using the Repository’s well-curated phenotypic data. This article describes the initial database plan for the Repository and its revision using a simpler model. Among the lessons learned were the trade-offs between the complexity of a database design and the costs in time and money of implementation; the …


Semantic Computing In Real-World: Vertical And Horizontal Application Within Enterprise And On The Web, Amit P. Sheth Sep 2011

Semantic Computing In Real-World: Vertical And Horizontal Application Within Enterprise And On The Web, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


When Recommendation Meets Mobile: Contextual And Personalised Recommendation On The Go, Jinfeng Zhuang, Tao Mei, Steven C. H. Hoi, Ying-Qing Xu, Shipeng Li Sep 2011

When Recommendation Meets Mobile: Contextual And Personalised Recommendation On The Go, Jinfeng Zhuang, Tao Mei, Steven C. H. Hoi, Ying-Qing Xu, Shipeng Li

Research Collection School Of Computing and Information Systems

Mobile devices are becoming ubiquitous. People use their phones as a personal concierge discovering and making decisions anywhere and anytime. Understanding user intent on the go therefore becomes important for task completion on the phone. While existing efforts have predominantly focused on understanding the explicit user intent expressed by a textual or voice query, this paper presents an approach to context-aware and personalized entity recommendation which understands the implicit intent without any explicit user input on the phone. The approach, highly motivated from a large-scale mobile click-through analysis, is able to rank both the entity types and the entities within …


Kino: A Generic Document Management System For Biologists Using Sa-Rest And Faceted Search, Ajith Harshana Ranabahu, Priti Parikh, Maryam Panahiazar, Amit P. Sheth Sep 2011

Kino: A Generic Document Management System For Biologists Using Sa-Rest And Faceted Search, Ajith Harshana Ranabahu, Priti Parikh, Maryam Panahiazar, Amit P. Sheth

Kno.e.sis Publications

Document management has become an important consideration for the scientific community over the last decade. Human knowledge is central to many scientific domains, thus it is not possible to completely automate the document management process. Managing scientific documents require a semi-automatic approach to overcome issues of large volume, yet support the human participation in the process. In this paper we present Kino, a set of tools that streamline the document management process in life science domains. Kino is integrated with National Center for Biomedical Ontology (NCBO), providing scientists access to quality domain models. Annotated documents are indexed using a faceted …


Privacy Beyond Single Sensitive Attribute, Yuan Fang, Mafruz Zaman Ashrafi, See Kiong Ng Sep 2011

Privacy Beyond Single Sensitive Attribute, Yuan Fang, Mafruz Zaman Ashrafi, See Kiong Ng

Research Collection School Of Computing and Information Systems

Publishing individual specific microdata has serious privacy implications. The k-anonymity model has been proposed to prevent identity disclosure from microdata, and the work on ℓ-diversity and t-closeness attempt to address attribute disclosure. However, most current work only deal with publishing microdata with a single sensitive attribute (SA), whereas real life scenarios often involve microdata with multiple SAs that may be multi-valued. This paper explores the issue of attribute disclosure in such scenarios. We propose a method called CODIP (Complete Disjoint Projections) that outlines a general solution to deal with the shortcomings in a naïve approach. We also introduce two measures, …


Spectral Geometry Image: Image Based 3d Models For Digital Broadcasting Applications, Boon Seng Chew, Lap Pui Chau, Ying He, Dayong Wang, Steven C. H. Hoi Sep 2011

Spectral Geometry Image: Image Based 3d Models For Digital Broadcasting Applications, Boon Seng Chew, Lap Pui Chau, Ying He, Dayong Wang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The use of 3D models for progressive transmission and broadcasting applications is an interesting challenge due to the nature and complexity of such content. In this paper, a new image format for the representation of 3D progressive model is proposed. The powerful spectral analysis is combined with the state of art Geometry Image(GI) to encode static 3D models into spectral geometry images(SGI) for robust 3D shape representation. Based on the 3D model's surface characteristics, SGI separated the geometrical image into low and high frequency layers to achieve effective Level of Details(LOD) modeling. For SGI, the connectivity data of the model …


Mining Top-K Large Structural Patterns In A Massive Network, Feida Zhu, Qiang Qu, David Lo, Xifeng Yan, Jiawei Han, Philip S. Yu Sep 2011

Mining Top-K Large Structural Patterns In A Massive Network, Feida Zhu, Qiang Qu, David Lo, Xifeng Yan, Jiawei Han, Philip S. Yu

Research Collection School Of Computing and Information Systems

With ever-growing popularity of social networks, web and bio-networks, mining large frequent patterns from a single huge network has become increasingly important. Yet the existing pattern mining methods cannot offer the efficiency desirable for large pattern discovery. We propose Spider- Mine, a novel algorithm to efficiently mine top-K largest frequent patterns from a single massive network with any user-specified probability of 1 − ϵ. Deviating from the existing edge-by-edge (i.e., incremental) pattern-growth framework, SpiderMine achieves its efficiency by unleashing the power of small patterns of a bounded diameter, which we call “spiders”. With the spider structure, our approach adopts a …


An Efficient Adaptive Vortex Particle Method For Real-Time Smoke Simulation, Shengfeng He, Hon-Cheng Wong, Un-Hong Wong Sep 2011

An Efficient Adaptive Vortex Particle Method For Real-Time Smoke Simulation, Shengfeng He, Hon-Cheng Wong, Un-Hong Wong

Research Collection School Of Computing and Information Systems

Smoke simulation is one of the interesting topics in computer animation and it usually involves turbulence generation. Efficient generation of realistic turbulent flows becomes one of the challenges in smoke simulation. Vortex particle method, which is a hybrid method that combines grid-based and particle-based approaches, is often used for generating turbulent details. However, it may cause irrational artifacts due to its initial condition and vorticity forcing approach used. In this paper, a new vorticity forcing approach based on the spatial adaptive vorticity confinement is proposed to address this problem. In this approach, the spatial adaptive vorticity confinement force varies with …


Structural Analysis Of The Hot Spots In The Binding Between H1n1 Ha And The 2di Antibody: Do Mutations Of H1n1 From 1918 To 2009 Affect Much On This Binding?, Qian Liu, Steven C. H. Hoi, Chinh T. T. Su, Zhenhua Li, Chee-Keong Kwoh, Limsoon Wong, Jinyan Li Sep 2011

Structural Analysis Of The Hot Spots In The Binding Between H1n1 Ha And The 2di Antibody: Do Mutations Of H1n1 From 1918 To 2009 Affect Much On This Binding?, Qian Liu, Steven C. H. Hoi, Chinh T. T. Su, Zhenhua Li, Chee-Keong Kwoh, Limsoon Wong, Jinyan Li

Research Collection School Of Computing and Information Systems

Worldwide and substantial mortality caused by the 2009 H1N1 influenza A has stimulated a new surge of research on H1N1 viruses. An epitope conservation has been learned in the HA1 protein that allows antibodies to cross-neutralize both 1918 and 2009 H1N1. However, few works have thoroughly studied the binding hot spots in those two antigen–antibody interfaces which are responsible for the antibody cross-neutralization. We apply predictive methods to identify binding hot spots at the epitope sites of the HA1 proteins and at the paratope sites of the 2D1 antibody. We find that the six mutations at the HA1's epitope from …


A Framework For Generating Data To Simulate Application Scoring, Kenneth Kennedy, Sarah Jane Delany, Brian Mac Namee Aug 2011

A Framework For Generating Data To Simulate Application Scoring, Kenneth Kennedy, Sarah Jane Delany, Brian Mac Namee

Conference papers

In this paper we propose a framework to generate artificial data that can be used to simulate credit risk scenarios. Artificial data is useful in the credit scoring domain for two reasons. Firstly, the use of artificial data allows for the introduction and control of variability that can realistically be expected to occur, but has yet to materialise in practice. The ability to control parameters allows for a thorough exploration of the performance of classification models under different conditions. Secondly, due to non-disclosure agreements and commercial sensitivities, obtaining real credit scoring data is a problematic and time consuming task. By …


Waldo In The Light Of Austerity And Federal Debt Crisis, Part 2, Jan Kallberg Aug 2011

Waldo In The Light Of Austerity And Federal Debt Crisis, Part 2, Jan Kallberg

Jan Kallberg

Waldo’s predictions about the future for public administration describe five areas that would be problematic in the future: legitimacy, authority, knowledge, control, and confidence. Legitimacy includes not only that the government is legally legitimized but capable and focused on an intention to deliver the “good society.” Authority, according to Waldo, is the ability to implement policy with the acceptance of the people based on rationalism, expectations of public good, ethics, superior knowledge, and institutional contexts. Knowledge is institutional knowledge, the ability to arrange and utilize knowledge within the bureaucracy since coordination is the major challenge in knowledge management. Government has …


Waldo In The Light Of Austerity And Federal Debt Crisis, Part 1, Jan Kallberg Aug 2011

Waldo In The Light Of Austerity And Federal Debt Crisis, Part 1, Jan Kallberg

Jan Kallberg

Dwight Waldo wrote The Enterprise of Public Administration in 1979 looking back on a long and fruitful academic career, but also as a reflection about the future for public administration. Can a 30 year old book still be relevant? You bet. Today, the public sector is increasingly facing fiscal challenges. Federal, state, and local governments throughout the country have major budget deficits followed by austerity measures that undermine the ability to deliver the good life of the future. In this day and age rereading Dwight Waldo’s The Enterprise of Public Administration is an intellectual exercise worth pursuing. Several of Dwight …


Creating An International Joint Certificate In It Administration, Peter Wolcott Aug 2011

Creating An International Joint Certificate In It Administration, Peter Wolcott

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

The University of Nebraska at Omaha (UNO) and the University of Agder (UiA), Norway, are collaborating on the creation of an undergraduate certificate in Information Technology Administration. The certificate is designed for students who are interested in managing the complex technical infrastructure of today's organizations. The certificate will consist of approximately 15 credit hours of hands-on courses, covering such areas as systems administration, network administration, database administration, security administration, and distributed systems. All courses will be offered online, using a variety of collaboration tools and teaching techniques that reflect the best of current practice. Students will take courses taught by …


Ccrank: Parallel Learning To Rank With Cooperative Coevolution, Shuaiqiang Wang, Byron J. Gao, Ke Wang, Hady W. Lauw Aug 2011

Ccrank: Parallel Learning To Rank With Cooperative Coevolution, Shuaiqiang Wang, Byron J. Gao, Ke Wang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

We propose CCRank, the first parallel algorithm for learning to rank, targeting simultaneous improvement in learning accuracy and efficiency. CCRank is based on cooperative coevolution (CC), a divide-and-conquer framework that has demonstrated high promise in function optimization for problems with large search space and complex structures. Moreover, CC naturally allows parallelization of sub-solutions to the decomposed subproblems, which can substantially boost learning efficiency. With CCRank, we investigate parallel CC in the context of learning to rank. Extensive experiments on benchmarks in comparison with the state-of-the-art algorithms show that CCRank gains in both accuracy and efficiency.


A Hubel Wiesel Model Of Early Concept Generalization Based On Local Correlation Of Input Features, Sepideh Sadeghi, Kiruthika Ramanathan Aug 2011

A Hubel Wiesel Model Of Early Concept Generalization Based On Local Correlation Of Input Features, Sepideh Sadeghi, Kiruthika Ramanathan

Research Collection School Of Computing and Information Systems

Hubel Wiesel models, successful in visual processing algorithms, have only recently been used in conceptual representation. Despite the biological plausibility of a Hubel-Wiesel like architecture for conceptual memory and encouraging preliminary results, there is no implementation of how inputs at each layer of the hierarchy should be integrated for processing by a given module, based on the correlation of the features. In our paper, we propose the input integration framework - a set of operations performed on the inputs to the learning modules of the Hubel Wiesel model of conceptual memory. These operations weight the modules as being general or …


Augmenting Online Learning With Real-Time Conferencing: Experiences From An International Course, Bjørn Erik Munkvold, Ilze Zigurs, Deepak Khazanchi Jul 2011

Augmenting Online Learning With Real-Time Conferencing: Experiences From An International Course, Bjørn Erik Munkvold, Ilze Zigurs, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

This paper reports experiences from the use of real-time conferencing to support synchronous class interaction in an international online course. Through combination of video, audio, application sharing and chat, the students and instructors engaged in weekly interactions in a virtual classroom. This created an environment for rich interaction, augmenting the traditional use of course repositories. Further, this gave the students hands-on experience with real-time conferencing tools which are increasingly common in the workplace. The paper also discusses experienced challenges related to combining the use of multiple synchronous communication channels and presents implications for further use of real-time conferencing in online …


Network Security: Privacy-Preserving Data Publication: A Review On “Updates” In Continuous Data Publication, Adeel Anjum, Guillaume Raschia Jul 2011

Network Security: Privacy-Preserving Data Publication: A Review On “Updates” In Continuous Data Publication, Adeel Anjum, Guillaume Raschia

International Conference on Information and Communication Technologies

Preserving the privacy of individuals while publishing their relevant data has been an important problem. Most of previous works in privacy preserving data publication focus on one time, static release of datasets. In multiple publications however, where data is published multiple times, these techniques are unable to ensure privacy of the concerned individuals as just joining either of the releases could result in identity disclosure. In this work, we tried to investigate the major findings in the scenario of continuous data publication, in which the data is not only published multiple times but also modified with INSERTS, UPDATES and DELETE …


Application Of Ict: Ascertaining Knowledge Flows Through Labor Mobility In The Ict Sector Of Pakistan, Abdul Baseer Qazi Jul 2011

Application Of Ict: Ascertaining Knowledge Flows Through Labor Mobility In The Ict Sector Of Pakistan, Abdul Baseer Qazi

International Conference on Information and Communication Technologies

This paper attempts to fill the gap in literature on channels of spillovers with a particular focus to the ICT sector and developing countries. With the help of a custom-made survey we have constructed variables which help to identify and measure the most prominent channels of spillovers suggested in literature. Our results corroborate labor mobility as one of the most important channel for inter-firm knowledge flows.


Artificial Intelligence - I: Adaptive Automated Teller Machines - Part Ii, Ghulam Mujtaba, Tariq Mahmood Jul 2011

Artificial Intelligence - I: Adaptive Automated Teller Machines - Part Ii, Ghulam Mujtaba, Tariq Mahmood

International Conference on Information and Communication Technologies

Nowadays, the banking sector is increasingly relying on Automated Teller Machines (ATMs) in order to provide services to its customers. Although thousands of ATMs exist across many banks and different locations, the GUI and content of a typical ATM interface remains, more or less, the same. For instance, any ATM provides typical options for withdrawal, electronic funds transfer, viewing of mini-statements etc. However, such a static interface might not be suitable for all ATM customers, e.g., some users might not prefer to view all the options when they access the ATM, or to view specific withdrawal amounts less than, say, …


Artificial Intelligence – I: Adaptive Automated Teller Machines — Part I, Ghulam Mujtaba, Tariq Mahmood Jul 2011

Artificial Intelligence – I: Adaptive Automated Teller Machines — Part I, Ghulam Mujtaba, Tariq Mahmood

International Conference on Information and Communication Technologies

During the past few years, the banking sector has started providing a variety of services to its customers. One of the most significant of such services has been the introduction of the Automated Teller Machines (ATMs) for providing online support to bank customers. The use of ATMs has reached its zenith in every developed country, and thousands of ATM transactions are occurring on a daily basis. In order to increase the customers' satisfaction and to provide them with more user-friendly ATM interfaces, it becomes important to mine the ATM transactions to discover useful patterns about the customers' interacting behaviors. In …


Evaluating And Implementing Web Scale Discovery Services: Part Two, Jason Vaughan, Tamera Hanken Jul 2011

Evaluating And Implementing Web Scale Discovery Services: Part Two, Jason Vaughan, Tamera Hanken

Library Faculty Presentations

Part Four: Quick Tour of the Current Marketplace:

  • "The Big 5"
  • Similarities and differences

Part Five: It's Not All Sliced Bread:

  • Shortcomings of web scale discovery

Part Six: Implementation (pre launch steps):

  • Selecting and preparing implementation staff
  • Preparing and communicating process/decisions with all staff
  • Working with the vendor (roles, expectations, timeline)
  • Workflow changes and implications (technical services)

Part Seven: Specific implementation tasks, issues, and considerations:

  • Record loading and mapping (catalog content)
  • Harvesting and mapping digital/local content
  • Working with central index data (internal & external content)
  • Web integration and customization
  • Assessment and continuous improvement