Pub Date : 2000-11-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1029%3E3.0.CO;2-P
S. P. Harter, C. Ford
This study1 assesses the ways in which citation searching of scholarly print journals is and is not analogous to backlink searching of scholarly e‐journal articles on the WWW, and identifies problems and issues related to conducting and interpreting such searches. Backlink searches are defined here as searches for Web pages that link to a given URL. Backlink searches were conducted on a sample of 39 scholarly electronic journals. Search results were processed to determine the number of backlinking pages, total backlinks, and external backlinks made to the e‐journals and to their articles. The results were compared to findings from a citation study performed on the same e‐journals in 1996. A content analysis of a sample of the files backlinked to e‐journal articles was also undertaken. The authors identify a number of reliability issues associated with the use of “raw” search engine data to evaluate the impact of electronic journals and articles. No correlation was found between backlink measures and ISI citation measures of e‐journal impact, suggesting that the two measures may be assessing something quite different. Major differences were found between the types of entities that cite, and those that backlink, e‐journal articles, with scholarly works comprising a very small percentage of backlinking files. These findings call into question the legitimacy of using backlink searches to evaluate the scholarly impact of e‐journals and e‐journal articles (and by extension, e‐journal authors).
{"title":"Web-based analyses of E-journal impact: Approaches, problems, and issues","authors":"S. P. Harter, C. Ford","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1029%3E3.0.CO;2-P","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1029%3E3.0.CO;2-P","url":null,"abstract":"This study1 assesses the ways in which citation searching of scholarly print journals is and is not analogous to backlink searching of scholarly e‐journal articles on the WWW, and identifies problems and issues related to conducting and interpreting such searches. Backlink searches are defined here as searches for Web pages that link to a given URL. Backlink searches were conducted on a sample of 39 scholarly electronic journals. Search results were processed to determine the number of backlinking pages, total backlinks, and external backlinks made to the e‐journals and to their articles. The results were compared to findings from a citation study performed on the same e‐journals in 1996. A content analysis of a sample of the files backlinked to e‐journal articles was also undertaken. The authors identify a number of reliability issues associated with the use of “raw” search engine data to evaluate the impact of electronic journals and articles. No correlation was found between backlink measures and ISI citation measures of e‐journal impact, suggesting that the two measures may be assessing something quite different. Major differences were found between the types of entities that cite, and those that backlink, e‐journal articles, with scholarly works comprising a very small percentage of backlinking files. These findings call into question the legitimacy of using backlink searches to evaluate the scholarly impact of e‐journals and e‐journal articles (and by extension, e‐journal authors).","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"8 1","pages":"1159-1176"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72977816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-11-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1030%3E3.0.CO;2-E
K. Ng, P. Kantor
Effective automation of the information retrieval task has long been an active area of research, leading to sophisticated retrieval models. With many IR schemes available, researchers have begun to investigate the benefits of combining the results of different IR schemes to improve performance, in the process called “data fusion.” There are many successful data fusion experiments reported in IR literature, but there are also cases in which it did not work well. Thus, if would be quite valuable to have a theory that can predict, in advance, whether fusion of two or more retrieval schemes will be worth doing. In previous study (Ng & Kantor, 1998), we identified two predictive variables for the effectiveness of fusion: (a) a list‐based measure of output dissimilarity, and (b) a pair‐wise measure of the similarity of performance of the two schemes. In this article we investigate the predictive power of these two variables in simple symmetrical data fusion. We use the IR systems participating in the TREC 4 routing task to train a model that predicts the effectiveness of data fusion, and use the IR systems participating in the TREC 5 routing task to test that model. The model asks, “when will fusion perform better than an oracle who uses the best scheme from each pair?” We explore statistical techniques for fitting the model to the training data and use the receiver operating characteristic curve of signal detection theory to represent the power of the resulting models. The trained prediction methods predict whether fusion will beat an oracle, at levels much higher than could be achieved by chance.
{"title":"Predicting the effectiveness of naïve data fusion on the basis of system characteristics","authors":"K. Ng, P. Kantor","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1030%3E3.0.CO;2-E","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1030%3E3.0.CO;2-E","url":null,"abstract":"Effective automation of the information retrieval task has long been an active area of research, leading to sophisticated retrieval models. With many IR schemes available, researchers have begun to investigate the benefits of combining the results of different IR schemes to improve performance, in the process called “data fusion.” There are many successful data fusion experiments reported in IR literature, but there are also cases in which it did not work well. Thus, if would be quite valuable to have a theory that can predict, in advance, whether fusion of two or more retrieval schemes will be worth doing. In previous study (Ng & Kantor, 1998), we identified two predictive variables for the effectiveness of fusion: (a) a list‐based measure of output dissimilarity, and (b) a pair‐wise measure of the similarity of performance of the two schemes. In this article we investigate the predictive power of these two variables in simple symmetrical data fusion. We use the IR systems participating in the TREC 4 routing task to train a model that predicts the effectiveness of data fusion, and use the IR systems participating in the TREC 5 routing task to test that model. The model asks, “when will fusion perform better than an oracle who uses the best scheme from each pair?” We explore statistical techniques for fitting the model to the training data and use the receiver operating characteristic curve of signal detection theory to represent the power of the resulting models. The trained prediction methods predict whether fusion will beat an oracle, at levels much higher than could be achieved by chance.","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"2 1","pages":"1177-1189"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86530382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-11-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1031%3E3.0.CO;2-B
Ying Ding, G. Chowdhury, S. Foo, Weizhong Qian
The aim of this article is to test whether the results obtained from a specific bibliographic research can be applied to a real search environment and enhance the level of utility of an information retrieval session for all levels of end users. In this respect, a Web-based Bibliometric Information Retrieval System (BIRS) has been designed and created, with facilities to assist the end users to get better understanding of their search domain, formulate and expand their search queries, and visualize the bibliographic research results. There are three specific features in the system design of the BIRS: the information visualization feature of the BIRS (cocitation maps) to guide the end users to identify the important research groups and capture the detailed information about the intellectual structure of the search domain; the multilevel browsing feature to allow the end users to go to different levels of interesting topics; and the common user interface feature to enable the end users to search all kinds of databases regardless of different searching systems, different working platforms, different database producer and supplier, such as different Web search engines, different library OPACs, or different on-line databases. A preliminary user evaluation study of BIRS revealed that users generally found it easy to form and expand their queries, and that BIRS helped them acquire useful background information about the search domain. They also pointed out aspects of information visualization, multilevel browsing, and common user interface as novel characteristics exhibited by BIRS.
{"title":"Bibliometric information retrieval system (BIRS): A web search interface utilizing bibliometric research results","authors":"Ying Ding, G. Chowdhury, S. Foo, Weizhong Qian","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1031%3E3.0.CO;2-B","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1031%3E3.0.CO;2-B","url":null,"abstract":"The aim of this article is to test whether the results obtained from a specific bibliographic research can be applied to a real search environment and enhance the level of utility of an information retrieval session for all levels of end users. In this respect, a Web-based Bibliometric Information Retrieval System (BIRS) has been designed and created, with facilities to assist the end users to get better understanding of their search domain, formulate and expand their search queries, and visualize the bibliographic research results. There are three specific features in the system design of the BIRS: the information visualization feature of the BIRS (cocitation maps) to guide the end users to identify the important research groups and capture the detailed information about the intellectual structure of the search domain; the multilevel browsing feature to allow the end users to go to different levels of interesting topics; and the common user interface feature to enable the end users to search all kinds of databases regardless of different searching systems, different working platforms, different database producer and supplier, such as different Web search engines, different library OPACs, or different on-line databases. A preliminary user evaluation study of BIRS revealed that users generally found it easy to form and expand their queries, and that BIRS helped them acquire useful background information about the search domain. They also pointed out aspects of information visualization, multilevel browsing, and common user interface as novel characteristics exhibited by BIRS.","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"20 1","pages":"1190-1204"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81152768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1020%3E3.0.CO;2-F
M. Wise
The Protein Annotators' Assistant (or PAA) (http://www.ebi.ac.uk/paa/) is a software system which assists protein annotators in the task of assigning functions to newly sequenced proteins. Working backward from SwissProt, a database which describes known proteins, and a prior sequence similarity search that returns a list of known proteins similar to a query, PAA suggests keywords and phrases which may describe functions performed by the query. In a preprocessing step, a database is built from the protein names that appear in the SwissProt database, and against each protein are listed key words and phrases that are extracted from the corresponding text records. Common words either in general English usage or from the biological domain are removed as the phrases are assembled. This process is assisted by the use of a simple stemming algorithm, which extends the list of stop‐words (i.e., reject words), together with a list of accept‐words. At runtime, the search algorithm, invoked by a user via a Web interface, takes a list of protein names and clusters the named proteins around keywords/phrases shared by members of the list. The assumption is that if these proteins have a particular keyword/phrase in common, and they are related to a query protein, then the keyword/phrase may also describe the query. Overall, PAA employs a number of IR techniques in a novel setting and is thus related to text categorization, where multiple categories may be suggested, except that in this case none of the categories are specified in advance.
Protein Annotators' Assistant(或PAA) (http://www.ebi.ac.uk/paa/)是一个软件系统，它可以帮助蛋白质注释者为新测序的蛋白质分配功能。PAA从SwissProt(一个描述已知蛋白质的数据库)和返回与查询相似的已知蛋白质列表的先前序列相似性搜索向后工作，建议可以描述查询执行的功能的关键字和短语。在预处理步骤中，根据出现在SwissProt数据库中的蛋白质名称建立数据库，并针对每个蛋白质列出从相应文本记录中提取的关键词和短语。在短语的组装过程中，无论是一般英语用法中的常用词还是来自生物领域的常用词都会被删除。该过程通过使用简单的词干提取算法来辅助，该算法扩展了停止词列表(即拒绝词)以及接受词列表。在运行时，由用户通过Web界面调用的搜索算法获取一个蛋白质名称列表，并将命名的蛋白质聚集在列表成员共享的关键字/短语周围。假设这些蛋白质有一个共同的关键字/短语，并且它们与查询蛋白质相关，那么关键字/短语也可以描述查询。总的来说，PAA在新的设置中使用了许多IR技术，因此与文本分类有关，其中可能建议使用多个类别，只是在这种情况下没有预先指定任何类别。
{"title":"Protein annotators' assistant: A novel application of information retrieval techniques","authors":"M. Wise","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1020%3E3.0.CO;2-F","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1020%3E3.0.CO;2-F","url":null,"abstract":"The Protein Annotators' Assistant (or PAA) (http://www.ebi.ac.uk/paa/) is a software system which assists protein annotators in the task of assigning functions to newly sequenced proteins. Working backward from SwissProt, a database which describes known proteins, and a prior sequence similarity search that returns a list of known proteins similar to a query, PAA suggests keywords and phrases which may describe functions performed by the query. In a preprocessing step, a database is built from the protein names that appear in the SwissProt database, and against each protein are listed key words and phrases that are extracted from the corresponding text records. Common words either in general English usage or from the biological domain are removed as the phrases are assembled. This process is assisted by the use of a simple stemming algorithm, which extends the list of stop‐words (i.e., reject words), together with a list of accept‐words. At runtime, the search algorithm, invoked by a user via a Web interface, takes a list of protein names and clusters the named proteins around keywords/phrases shared by members of the list. The assumption is that if these proteins have a particular keyword/phrase in common, and they are related to a query protein, then the keyword/phrase may also describe the query. Overall, PAA employs a number of IR techniques in a novel setting and is thus related to text categorization, where multiple categories may be suggested, except that in this case none of the categories are specified in advance.","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"31 1","pages":"1131-1136"},"PeriodicalIF":0.0,"publicationDate":"2000-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89250036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1018%3E3.0.CO;2-T
Hur-Li Lee
Advances in information technology have dramatically changed information seeking, and necessitate an examination of traditional conceptions of library collection. This article addresses the task and reveals four major presumptions associated with collections: tangibility, ownership, a user community, and an integrated retrieval mechanism. Some of these presumptions have served only to perpetuate misconceptions of collection. Others seem to have become more relevant in the current information environment. The emergence of nontraditional media, such as the World Wide Web (WWW), poses two specific challenges: to question the necessity of finite collections, and contest the boundaries of a collection. A critical analysis of these issues results in a proposal for an expanded concept of collection that considers the perspectives of both the user and the collection developer, invites rigorous user-centered research, and looks at the collection as an information-seeking context.
{"title":"What is a collection?","authors":"Hur-Li Lee","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1018%3E3.0.CO;2-T","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1018%3E3.0.CO;2-T","url":null,"abstract":"Advances in information technology have dramatically changed information seeking, and necessitate an examination of traditional conceptions of library collection. This article addresses the task and reveals four major presumptions associated with collections: tangibility, ownership, a user community, and an integrated retrieval mechanism. Some of these presumptions have served only to perpetuate misconceptions of collection. Others seem to have become more relevant in the current information environment. The emergence of nontraditional media, such as the World Wide Web (WWW), poses two specific challenges: to question the necessity of finite collections, and contest the boundaries of a collection. A critical analysis of these issues results in a proposal for an expanded concept of collection that considers the perspectives of both the user and the collection developer, invites rigorous user-centered research, and looks at the collection as an information-seeking context.","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"15 1","pages":"1106-1113"},"PeriodicalIF":0.0,"publicationDate":"2000-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72983608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1014%3E3.0.CO;2-4
L. Egghe, R. Rousseau
Relative own-language preference depends on two parameters: the publication share of the language, and the self-citing rate. Openness of language L with respect to language J depends on three parameters: the publication share of language L, the publication share of language J, and the citation share of language J among all citations given by language L. It is shown that the relative own-language preference and the openness of one language with respect to another one, can be represented by a partial order. This partial order can be represented by a polygonal line (for the relative own-language preference) or a three-dimensional solid (for openness), somewhat in the same spirit as the Lorenz curve for concentration and evenness. Any function used to measure relative own-language preference or openness of one language with respect to another one should at least respect the corresponding partial orders. This is a minimum requirement for such measures. Depending on the use one wants to make of these measures other requirements become necessary. A logarithmic dependence on the language share(s) seems a natural additional requirement. This would correspond with the logarithmic behavior of psychophysical sensations. We give examples of normalized functions satisfying this additional requirement. It is further investigated if openness partial orders can lead to measures for relative own-language preference. The article ends with some examples related to the language use in some sociological journals.
{"title":"Partial orders and measures for language preferences","authors":"L. Egghe, R. Rousseau","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1014%3E3.0.CO;2-4","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1014%3E3.0.CO;2-4","url":null,"abstract":"Relative own-language preference depends on two parameters: the publication share of the language, and the self-citing rate. Openness of language L with respect to language J depends on three parameters: the publication share of language L, the publication share of language J, and the citation share of language J among all citations given by language L. It is shown that the relative own-language preference and the openness of one language with respect to another one, can be represented by a partial order. This partial order can be represented by a polygonal line (for the relative own-language preference) or a three-dimensional solid (for openness), somewhat in the same spirit as the Lorenz curve for concentration and evenness. Any function used to measure relative own-language preference or openness of one language with respect to another one should at least respect the corresponding partial orders. This is a minimum requirement for such measures. Depending on the use one wants to make of these measures other requirements become necessary. A logarithmic dependence on the language share(s) seems a natural additional requirement. This would correspond with the logarithmic behavior of psychophysical sensations. We give examples of normalized functions satisfying this additional requirement. It is further investigated if openness partial orders can lead to measures for relative own-language preference. The article ends with some examples related to the language use in some sociological journals.","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"22 1","pages":"1123-1130"},"PeriodicalIF":0.0,"publicationDate":"2000-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83330778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1026%3E3.0.CO;2-Y
P. Bruza, D. Song, Kam-Fai Wong
Information retrieval (IR) is driven by a process that decides whether a document is about a query. Recent attempts spawned from a logic-based information retrieval theory have formalized properties characterizing “aboutness,” but no consensus has yet been reached. The proposed properties are largely determined by the underlying framework within which aboutness is defined. In addition, some properties are only sound within the context of a given IR model, but are not sound from the perspective of the user. For example, a common form of aboutness, namely overlapping aboutness, implies precision degrading properties such as compositional monotonicity. Therefore, the motivating question for this article is: independent of any given IR model, and examined within an information-based, abstract framework, what are commonsense properties of aboutness (and its dual, nonaboutness)? We propose a set of properties characterizing aboutness and nonaboutness from a commonsense perspective. Special attention is paid to the rules prescribing conservative behavior of aboutness with respect to information composition. The interaction between aboutness and nonaboutness is modeled via normative rules. The completeness, soundness, and consistency of the aboutness proof systems are analyzed and discussed. A case study based on monotonicity shows that many current IR systems are either monotonic or nonmonotonic. An interesting class of IR models, namely those that are conservatively monotonic, is identified.
{"title":"Aboutness from a commonsense perspective","authors":"P. Bruza, D. Song, Kam-Fai Wong","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1026%3E3.0.CO;2-Y","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1026%3E3.0.CO;2-Y","url":null,"abstract":"Information retrieval (IR) is driven by a process that decides whether a document is about a query. Recent attempts spawned from a logic-based information retrieval theory have formalized properties characterizing “aboutness,” but no consensus has yet been reached. The proposed properties are largely determined by the underlying framework within which aboutness is defined. In addition, some properties are only sound within the context of a given IR model, but are not sound from the perspective of the user. For example, a common form of aboutness, namely overlapping aboutness, implies precision degrading properties such as compositional monotonicity. Therefore, the motivating question for this article is: independent of any given IR model, and examined within an information-based, abstract framework, what are commonsense properties of aboutness (and its dual, nonaboutness)? We propose a set of properties characterizing aboutness and nonaboutness from a commonsense perspective. Special attention is paid to the rules prescribing conservative behavior of aboutness with respect to information composition. The interaction between aboutness and nonaboutness is modeled via normative rules. The completeness, soundness, and consistency of the aboutness proof systems are analyzed and discussed. A case study based on monotonicity shows that many current IR systems are either monotonic or nonmonotonic. An interesting class of IR models, namely those that are conservatively monotonic, is identified.","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"16 1","pages":"1090-1105"},"PeriodicalIF":0.0,"publicationDate":"2000-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82621975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1017%3E3.0.CO;2-W
Andrew Large, J. Beheshti
This article presents and discusses interviews with 50 grade-6 primary school students about their experience of using the Web to find information for a class project. The children discuss the quantity and quality of textual and image information on the Web versus traditional print sources, and the reasons why they made very little use of any moving images and sound clips on the Web. They also discuss how they searched for information on the Web and the ways in which this differs from looking for information in printed sources. The children overall demonstrate a sophistication both in their appreciation of the Web's strengths and weaknesses as an information source, and in their information retrieval strategies. In their reaction to the Web compared with traditional print sources, they can be categorized as technophiles, traditionalists, or pragmatists. The results from this research study suggest that although the Web can make an important contribution to information retrieval by school students, for the time being, at any rate, a role also remains both for other electronic sources such as CD-ROMs and print materials that are targeted specifically at young users. The Web needs both a more straightforward interface and more information specifically aimed at the young before it can seriously threaten its rivals.
{"title":"The web as a classroom resource: Reactions from the users","authors":"Andrew Large, J. Beheshti","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1017%3E3.0.CO;2-W","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1017%3E3.0.CO;2-W","url":null,"abstract":"This article presents and discusses interviews with 50 grade-6 primary school students about their experience of using the Web to find information for a class project. The children discuss the quantity and quality of textual and image information on the Web versus traditional print sources, and the reasons why they made very little use of any moving images and sound clips on the Web. They also discuss how they searched for information on the Web and the ways in which this differs from looking for information in printed sources. The children overall demonstrate a sophistication both in their appreciation of the Web's strengths and weaknesses as an information source, and in their information retrieval strategies. In their reaction to the Web compared with traditional print sources, they can be categorized as technophiles, traditionalists, or pragmatists. The results from this research study suggest that although the Web can make an important contribution to information retrieval by school students, for the time being, at any rate, a role also remains both for other electronic sources such as CD-ROMs and print materials that are targeted specifically at young users. The Web needs both a more straightforward interface and more information specifically aimed at the young before it can seriously threaten its rivals.","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"59 1","pages":"1069-1080"},"PeriodicalIF":0.0,"publicationDate":"2000-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88305267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-09-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1004%3E3.0.CO;2-5
Robert C. Ward, G. Wamsley, Aaron Schroeder, David Robins
Research findings from the organizational theory tend to support the position that management uses Information Technology (IT) to maintain existing organizational hierachy and control. Another body of research from information technology advocates suggests that Information Technology's inherent capabilities transform organization hierarchy and control outside of management's control. In addition, advocates from governmental change toward a more responsive type of government advocate adoption of IT as a form of change mechanism. This aritcle explores these conflicting positions. The authors examines one instance of the development of a form of network organization within the federal government, and the processes of IT change that have occurred over the past 20 years. The agency selected for study is the Federal Emergency Mangagement Administration.
{"title":"Network organizational development in the public sector: A case study of the federal emergency management administration (FEMA)","authors":"Robert C. Ward, G. Wamsley, Aaron Schroeder, David Robins","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1004%3E3.0.CO;2-5","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1004%3E3.0.CO;2-5","url":null,"abstract":"Research findings from the organizational theory tend to support the position that management uses Information Technology (IT) to maintain existing organizational hierachy and control. Another body of research from information technology advocates suggests that Information Technology's inherent capabilities transform organization hierarchy and control outside of management's control. In addition, advocates from governmental change toward a more responsive type of government advocate adoption of IT as a form of change mechanism. This aritcle explores these conflicting positions. The authors examines one instance of the development of a form of network organization within the federal government, and the processes of IT change that have occurred over the past 20 years. The agency selected for study is the Federal Emergency Mangagement Administration.","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"33 1","pages":"1018-1032"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85053937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-09-01DOI: 10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1002%3E3.0.CO;2-B
E. Efthimiadis
A user-centered investigation of interactive query expansion within the context of a relevance feedback system is presented in this article. Data were collected from 25 searches using the INSPEC database. The data collection mechanisms included questionnaires, transaction logs, and relevance evaluations. The results discuss issues that relate to query expansion, retrieval effectiveness, the correspondence of the on-line-to-off-line relevance judgments, and the selection of terms for query expansion by users (interactive query expansion). The main conclusions drawn from the results of the study are that: (1) one-third of the terms presented to users in a list of candidate terms for query expansion was identified by the users as potentially useful for query expansion. (2) These terms were mainly judged as either variant expressions (synonyms) or alternative (related) terms to the initial query terms. However, a substantial portion of the selected terms were identified as representing new ideas. (3) The relationships identified between the five best terms selected by the users for query expansion and the initial query terms were that: (a) 34% of the query expansion terms have no relationship or other type of correspondence with a query term; (b) 66% of the remaining query expansion terms have a relationship to the query terms. These relationships were: narrower term (46%), broader term (3%), related term (17%). (4) The results provide evidence for the effectiveness of interactive query expansion. The initial search produced on average three highly relevant documents; the query expansion search produced on average nine further highly relevant documents. The conclusions highlight the need for more research on: interactive query expansion, the comparative evaluation of automatic vs. interactive query expansion, the study of weighted Web-based or Web-accessible retrieval systems in operational environments, and for user studies in searching ranked retrieval systems in general.
{"title":"Interactive query expansion: A user-based evaluation in a relevance feedback environment","authors":"E. Efthimiadis","doi":"10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1002%3E3.0.CO;2-B","DOIUrl":"https://doi.org/10.1002/1097-4571(2000)9999:9999%3C::AID-ASI1002%3E3.0.CO;2-B","url":null,"abstract":"A user-centered investigation of interactive query expansion within the context of a relevance feedback system is presented in this article. Data were collected from 25 searches using the INSPEC database. The data collection mechanisms included questionnaires, transaction logs, and relevance evaluations. The results discuss issues that relate to query expansion, retrieval effectiveness, the correspondence of the on-line-to-off-line relevance judgments, and the selection of terms for query expansion by users (interactive query expansion). The main conclusions drawn from the results of the study are that: (1) one-third of the terms presented to users in a list of candidate terms for query expansion was identified by the users as potentially useful for query expansion. (2) These terms were mainly judged as either variant expressions (synonyms) or alternative (related) terms to the initial query terms. However, a substantial portion of the selected terms were identified as representing new ideas. (3) The relationships identified between the five best terms selected by the users for query expansion and the initial query terms were that: (a) 34% of the query expansion terms have no relationship or other type of correspondence with a query term; (b) 66% of the remaining query expansion terms have a relationship to the query terms. These relationships were: narrower term (46%), broader term (3%), related term (17%). (4) The results provide evidence for the effectiveness of interactive query expansion. The initial search produced on average three highly relevant documents; the query expansion search produced on average nine further highly relevant documents. The conclusions highlight the need for more research on: interactive query expansion, the comparative evaluation of automatic vs. interactive query expansion, the study of weighted Web-based or Web-accessible retrieval systems in operational environments, and for user studies in searching ranked retrieval systems in general.","PeriodicalId":50013,"journal":{"name":"Journal of the American Society for Information Science and Technology","volume":"37 1","pages":"989-1003"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81502053","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：