Wednesday, September 15, 2010

Berry Picking Model

Berry picking model is used to describe the basics of information access system. It was proposed by Bates in 1989 [1]. There are two main points in this model.

  1. User’s information need continually shift as a result of reading and learning from the information gathered during search process. Information from one point lead to another new point of information. The original information need become partly fulfilled thus lowering the priority of one goal favor of another. This to contrast the assumption of standard information retrieval that users’ information needs remain the same through out the search process.
  2. Users’ information needs are satisfied by a series of selection and information retrieve during search process. This to contrast the assumption that the search goal is focused only to the set of retrieved document into a perfect match of the original information need

This model also been supported by several others information seeking studies including [2]. They found that information seeking process consist of series of interconnected but diverse searches on one problem-based theme. The result item can lead to another new goals and search to the new direction.

We can see the new technologies in Google search engine, such as query suggestion, Google Instant and spelling correction, leading to a new dimension of web search.

  1. BATES, M. J. 1993. The design of browsing and berrypicking techniques for the online search interface. Online Information Review, 13, 407 - 424.
  2. O'DAY, V. L. & JEFFRIES, R. 1993. Orienteering in an information landscape: how information seekers get from here to there. Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems. Amsterdam, The Netherlands: ACM.

Tuesday, September 14, 2010

Information Access Process - using search engine

Usually when we want to search information about something we normally have one of more goals in mind, and we will use search engine like Google to do the searching. We either asking specific question or do exhaustive research in order to get the information. There are 3 main types of information seeking tasks [1]

1. Monitor the topic over time
2. Follow the planned search activities to achieve particular goals
3. Exploring the topic in an undirected fashion


Information Searching model


The standard steps involved in search process as below. This process also been used by current web search engine [2,3]

1. Start with Information need
2. Select a system and collection to search on
3. Formulate the query
4. Send the query to system
5. Receive search result in form of result-list
6. Scan, evaluate and interpret the result.
7. If not satisfy, return to step 3 – reformulate the query
8. In satisfy with the result - stop

Users learn during search process. When they receive the research result, firstly they will scan the result item, read the title, snippet, and URL. Read the retrieved page, viewing if any of the content in the page related to the submitted query, navigating within the hyperlinked web site in the page. Normally, users will scan the information structure, titles, thesaurus terms, hyperlinks, category labels or result of clustering and then either select the result item to read in detail, use as input to formulate another query, and navigate to a new page of information. Then if still not satisfy with the information, they will formulate a query – either from the already known information or from the combination with the new information.

1. O'DAY, V. L. & JEFFRIES, R. 1993. Orienteering in an information landscape: how information seekers get from here to there. Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems. Amsterdam, The Netherlands: ACM.
2. SALTON, G. 1989. Automatic text processing: the transformation, analysis, and retrieval of information by computer, Addison-Wesley Longman Publishing Co., Inc.
3. SHNEIDERMAN, B., BYRD, D. & CROFT, W. B. 1998. Sorting out searching: a user-interface framework for text searches. Commun. ACM, 41, 95-98.