Log in

Relevant bibliographies by topics / Search Log / Journal articles

Journal articles on the topic 'Search Log'

To see the other types of publications on this topic, follow the link: Search Log.

Author: Grafiati

Published: 11 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Search Log.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

V. S, Stency, and Sureshkumar R. "Semantic Search Log for Social Personalized Search." International Journal of Computer Trends and Technology 11, no. 3 (May 25, 2014): 122–27. http://dx.doi.org/10.14445/22312803/ijctt-v11p126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Garey, L. E., and R. D. Gupta. "A note on continuous search algorithms." Journal of Applied Probability 24, no. 1 (March 1987): 277–80. http://dx.doi.org/10.2307/3214081.

Full text

Abstract:

Continuous random search methods with an average complexity given by O(log(1/ε)) for ε → 0 where ε is a given accuracy were presented in a recent paper. In this article an example of an O(log log(1/ε)) method is presented and illustrated.

APA, Harvard, Vancouver, ISO, and other styles

3

Garey, L. E., and R. D. Gupta. "A note on continuous search algorithms." Journal of Applied Probability 24, no. 01 (March 1987): 277–80. http://dx.doi.org/10.1017/s0021900200030837.

Full text

Abstract:

Continuous random search methods with an average complexity given by O(log(1/ε)) for ε → 0 where ε is a given accuracy were presented in a recent paper. In this article an example of an O(log log(1/ε)) method is presented and illustrated.

APA, Harvard, Vancouver, ISO, and other styles

4

Buzikashvili, Nikolai. "Towards Query Log-Based Sociology of Search." International Journal of Chaotic Computing 4, no. 1 (June 30, 2016): 53–61. http://dx.doi.org/10.20533/ijcc.2046.3359.2016.0007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Jiang, Di, and Lingxiao Yang. "Query intent inference via search engine log." Knowledge and Information Systems 49, no. 2 (January 18, 2016): 661–85. http://dx.doi.org/10.1007/s10115-015-0915-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Maheswari, K., and Dr S. Kiruba karan. "Enhancing Social Personalized Search Based on Semantic Search Log using Ontology." International Journal of Innovative Research in Science, Engineering and Technology 03, no. 09 (September 15, 2014): 16238–42. http://dx.doi.org/10.15680/ijirset.2014.0309061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Arunachalam, Srinivasan, and Ronald de Wolf. "Optimizing the number of gates in quantum search." Quantum Information and Computation 17, no. 3&4 (March 2017): 251–61. http://dx.doi.org/10.26421/qic17.3-4-4.

Full text

Abstract:

In its usual form, Grover’s quantum search algorithm uses O( √ N) queries and O( √ N log N) other elementary gates to find a solution in an N-bit database. Grover in 2002 showed how to reduce the number of other gates to O( √ N log log N) for the special case where the database has a unique solution, without significantly increasing the number of queries. We show how to reduce this further to O( √ N log(r) N) gates for every constant r, and sufficiently large N. This means that, on average, the circuits between two queries barely touch more than a constant number of the log N qubits on which the algorithm acts. For a very large N that is a power of 2, we can choose r such that the algorithm uses essentially the minimal number π 4 √ N of queries, and only O( √ N log(log? N)) other gates.

APA, Harvard, Vancouver, ISO, and other styles

8

Belinsha, S., and A. P. V. Raghavendra. "Enhanced Utility in Search Log Publishing of Infrequent Items." International Journal of Information Technology and Web Engineering 9, no. 2 (April 2014): 65–77. http://dx.doi.org/10.4018/ijitwe.2014040104.

Full text

Abstract:

Search engines are being widely used by the web users. The search engine companies are concerned to produce best search results. Search logs are the records which records the interactions between the user and the search engine. Various search patterns, user's behaviors can be analyzed from these logs, which will help to enhance the search results. Publishing these search logs to third party for analysis is a privacy issue. Zealous algorithm of filtering the frequent search items in the search log looses its utility in the course of providing privacy. The proposed confess algorithm extends the work by qualifying the infrequent search items in the log which tends to increase the utility of the search log by preserving the privacy. Confess algorithm involves qualifying the infrequent keywords, URL clicks in the search log and publishing it along with the frequent items.

APA, Harvard, Vancouver, ISO, and other styles

9

Creasey, Peter E. "Two hide-search games with rapid strategies for multiple parallel searches." Open Computer Science 12, no. 1 (January 1, 2022): 171–80. http://dx.doi.org/10.1515/comp-2022-0243.

Full text

Abstract:

Abstract Making a rapid unpredictable decision from N N choices of unequal value is a common control task. When the cost of predictability can be modelled as a penalty hidden under a single option by an intelligent adversary, then an optimal strategy can be found efficiently in O ( N log N ) O\left(N\log N) steps using an approach described by Sakaguchi for a zero-sum hide-search game. In this work, we extend this to two games with multiple parallel predictions, either coordinated or drawn independently from the optimal distribution, both of which can be solved with the same scaling. An open-source code is provided online at https://github.com/pec27/rams.

APA, Harvard, Vancouver, ISO, and other styles

10

Jiang, Ming, PeiSi Cen, JingFan Tang, and Xing Qi Wang. "Personalized Video Search Based on User Log Mining." Information Technology Journal 12, no. 4 (April 1, 2013): 770–76. http://dx.doi.org/10.3923/itj.2013.770.776.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Ni, Weijian, Tong Liu, Qingtian Zeng, and Nengfu Xie. "Mining Domain Terminologies Using Search Engine's Query Log." ACM Transactions on Asian and Low-Resource Language Information Processing 20, no. 6 (November 30, 2021): 1–32. http://dx.doi.org/10.1145/3462327.

Full text

Abstract:

Domain terminologies are a basic resource for various natural language processing tasks. To automatically discover terminologies for a domain of interest, most traditional approaches mostly rely on a domain-specific corpus given in advance; thus, the performance of traditional approaches can only be guaranteed when collecting a high-quality domain-specific corpus, which requires extensive human involvement and domain expertise. In this article, we propose a novel approach that is capable of automatically mining domain terminologies using search engine's query log—a type of domain-independent corpus of higher availability, coverage, and timeliness than a manually collected domain-specific corpus. In particular, we represent query log as a heterogeneous network and formulate the task of mining domain terminology as transductive learning on the heterogeneous network. In the proposed approach, the manifold structure of domain-specificity inherent in query log is captured by using a novel network embedding algorithm and further exploited to reduce the need for the manual annotation efforts for domain terminology classification. We select Agriculture and Healthcare as the target domains and experiment using a real query log from a commercial search engine. Experimental results show that the proposed approach outperforms several state-of-the-art approaches.

APA, Harvard, Vancouver, ISO, and other styles

12

Ntzoufras, Ioannis, Jonathan J. Forster, and Petros Dellaportas. "Stochastic search variable selection for log-linear models." Journal of Statistical Computation and Simulation 68, no. 1 (December 2000): 23–37. http://dx.doi.org/10.1080/00949650008812054.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Yoon, Taebok, and Jee-Hyong Lee. "Adaptive Web Search based on User Web Log." Journal of the Korea Academia-Industrial cooperation Society 15, no. 11 (November 30, 2014): 6856–62. http://dx.doi.org/10.5762/kais.2014.15.11.6856.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Burt, Wayne V. "The Search for the Manila Galleon Log Books." Bulletin of the American Meteorological Society 71, no. 11 (November 1990): 1630–36. http://dx.doi.org/10.1175/1520-0477(1990)071<1630:tsftmg>2.0.co;2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

MYERS, E., and X. HUANG. "An ( log ) restriction map comparison and search algorithm." Bulletin of Mathematical Biology 54, no. 4 (July 1992): 599–618. http://dx.doi.org/10.1016/s0092-8240(05)80078-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Mat-Hassan, Mazlita, and Mark Levene. "Associating search and navigation behavior through log analysis." Journal of the American Society for Information Science and Technology 56, no. 9 (2005): 913–34. http://dx.doi.org/10.1002/asi.20185.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Schultheiß, Sebastian, Alexandra Linhart, Christiane Behnert, Imke Rulik, and Dirk Lewandowski. "Known-item searches and search tactics in library search systems: Results from four transaction log analysis studies." Journal of Academic Librarianship 46, no. 5 (September 2020): 102202. http://dx.doi.org/10.1016/j.acalib.2020.102202.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Chawla, Suruchi. "Application of Convolution Neural Networks in Web Search Log Mining for Effective Web Document Clustering." International Journal of Information Retrieval Research 12, no. 1 (January 2022): 1–14. http://dx.doi.org/10.4018/ijirr.300367.

Full text

Abstract:

The volume of web search data stored in search engine log is increasing and has become big search log data. The web search log has been the source of data for mining based on web document clustering techniques to improve the efficiency and effectiveness of information retrieval. In this paper Deep Learning Model Convolution Neural Network(CNN) is used in big web search log data mining to learn the semantic representation of a document. These semantic documents vectors are clustered using K-means to group relevant documents for effective web document clustering. Experiment was done on the data set of web search query and associated clicked URLs to measure the quality of clusters based on document semantic representation using Deep learning model CNN. The clusters analysis was performed based on WCSS(the sum of squared distances of documents samples to their closest cluster center) and decrease in the WCSS in comparison to TF.IDF keyword based clusters confirm the effectiveness of CNN in web search log mining for effective web document clustering.

APA, Harvard, Vancouver, ISO, and other styles

19

Hollink, Vera, Theodora Tsikrika, and Arjen P. de Vries. "Semantic search log analysis: A method and a study on professional image search." Journal of the American Society for Information Science and Technology 62, no. 4 (February 9, 2011): 691–713. http://dx.doi.org/10.1002/asi.21484.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Sholihah, Walidatush, Sangga Pripambudi, and Anggi Mardiyono. "Log Event Management Server Menggunakan Elastic Search Logstash Kibana (ELK Stack)." JTIM : Jurnal Teknologi Informasi dan Multimedia 2, no. 1 (May 20, 2020): 12–20. http://dx.doi.org/10.35746/jtim.v2i1.79.

Full text

Abstract:

This study aims to build an Event Management Server Log using ELK Stack (Elastic searchLogstash Kibana) which can make it easier to read and analyze log services on the server. TheEvent Management Server log in this study uses CentOS 7 as the Central Server and CentOS7 as a client-server with ssh services installed. This research consists of five stages. The stagesare analysis, network design, server configuration, client configuration, and testing. Theexperimental results show that all ssh log services that occur on the client-server sent inrealtime to the central server. Even though the contents of the log file on the client-server hasdeleted. In This study, in addition to sending logs, it can also display a percentage of successreferences.

APA, Harvard, Vancouver, ISO, and other styles

21

TERABE, Shintaro, Kosuke JYURI, and Hisao UCHIYAMA. "Log Analysis of Web Site for Railway Route Search." INFRASTRUCTURE PLANNING REVIEW 26 (2009): 569–74. http://dx.doi.org/10.2208/journalip.26.569.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hanna, Wael K., Aziza Saad Asem, and M. B. Senousy. "Dynamic Query Intent Prediction from a Search Log Stream." International Journal of Information Retrieval Research 6, no. 2 (April 2016): 66–85. http://dx.doi.org/10.4018/ijirr.2016040104.

Full text

Abstract:

The users that used search engines are obligated to express their goals in few words (queries). Sometimes search queries are ambiguous. Moreover, the users' intents are dynamically evolving. This paper analyzes the user's query logs to classify the related queries, the related intent topic categories and the related intent types and use this classification to dynamically predict the users' future queries, its intent topic and its intent type. AOL Search Query Log is taken as an experimental data set. Then use evaluation metrics to evaluate the prediction results.

APA, Harvard, Vancouver, ISO, and other styles

23

Islamaj Dogan, R., G. C. Murray, A. Neveol, and Z. Lu. "Understanding PubMed(R) user search behavior through log analysis." Database 2009 (November 27, 2009): bap018. http://dx.doi.org/10.1093/database/bap018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

PANDEY, RAS B., and DIETRICH STAUFFER. "SEARCH FOR LOG-PERIODIC OSCILLATIONS IN STOCK MARKET SIMULATIONS." International Journal of Theoretical and Applied Finance 03, no. 03 (July 2000): 479–82. http://dx.doi.org/10.1142/s0219024900000437.

Full text

Abstract:

Using Chowdhury's simplification of the Cont–Bouchaud percolation algorithm, and including inertia (trading momentum) as well as a nonlinear restoring force (pricing pressure), we find spontaneous oscillations, which for suitable parameters have at first an exponentially increasing period. They seem to mimic the approximate log-periodic oscillations found by Johansen and Sornette in the Nikkei index after the burst of the Japanese bubble a decade ago.

APA, Harvard, Vancouver, ISO, and other styles

25

Malyutov, Mikhail B. "Log-efficient search for significant inputs of linear model." Journal of Statistical Planning and Inference 100, no. 2 (February 2002): 269–80. http://dx.doi.org/10.1016/s0378-3758(01)00139-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Bajracharya, Sushil Krishna, and Cristina Videira Lopes. "Analyzing and mining a code search engine usage log." Empirical Software Engineering 17, no. 4-5 (September 18, 2010): 424–66. http://dx.doi.org/10.1007/s10664-010-9144-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

LeemaPriyadharshini, L., S. Florence, K. Prema, and C. Shyamala Kumari. "Predicting implicit search behaviors usinglog analysis." International Journal of Engineering & Technology 7, no. 1.7 (February 5, 2018): 91. http://dx.doi.org/10.14419/ijet.v7i1.7.9582.

Full text

Abstract:

Search engines provide ranked information based on the query given by the user. Understanding user search behavior is an important task for satisfaction of the users with the needed information. Understanding user search behaviors and recommending more information or more sites to the user is an emerging task. The work is based on the queries given by the user, the amount of time the user spending on the particular page, the number of clicks done by the user particular URL. These details will be available in the dataset of web search log. The web search log is nothing but the log which contains the user searching activities and other details like machine ID, browser ID, timestamp, query given by the user, URL accessed etc., four things considered as the important: 1) Extraction of tasks from the sequence of queries given by the user 2) suggesting some similar query to the user 3) ranking URLs based on the implicit user behaviors 4) increasing web page utilities based on the implicit behaviors. For increasing the web page utility and ranking the URLs predicting implicit user behavior is a needed task. For each of these four things designing and implementation of some algorithms and techniques are needed to increase the efficiency and effectiveness.

APA, Harvard, Vancouver, ISO, and other styles

28

Huntington, Paul, David Nicholas, and Hamid R. Jamali. "Employing log metrics to evaluate search behaviour and success: case study BBC search engine." Journal of Information Science 33, no. 5 (April 10, 2007): 584–97. http://dx.doi.org/10.1177/0165551506077407.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Blecic, Deborah D., Nirmala S. Bangalore, Josephine L. Dorsch, Cynthia L. Henderson, Melissa H. Koenig, and Ann C. Weller. "Using Transaction Log Analysis to Improve OPAC Retrieval Results." College & Research Libraries 59, no. 1 (January 1, 1998): 39–50. http://dx.doi.org/10.5860/crl.59.1.39.

Full text

Abstract:

This OPAC transaction log analysis study compared data derived from two sets of logs within a six-month period. Analysis of the first set of data revealed that users experienced difficulty with basic searching techniques. The OPAC introductory screens were simplified and clarified to help users improve search success rates. The second set of data, analyzed after screen changes had been made, showed statistically significant differences in search results. Regular monitoring of OPACs through transaction log analysis can lead to improved retrieval when changes are made in response to an analysis of user search patterns.

APA, Harvard, Vancouver, ISO, and other styles

30

Ambainis, Andris, Renato Portugal, and Nikolay Nahimov. "Spatial search on grids with minimum memory." Quantum Information and Computation 15, no. 13&14 (October 2015): 1233–47. http://dx.doi.org/10.26421/qic15.13-14-9.

Full text

Abstract:

We study quantum algorithms for spatial search on finite dimensional grids. Patel \textit{et al.}~and Falk have proposed algorithms based on a quantum walk without a coin, with different operators applied at even and odd steps. Until now, such algorithms have been studied only using numerical simulations. In this paper, we present the first rigorous analysis for an algorithm of this type, showing that the optimal number of steps is $O(\sqrt{N\log N})$ and the success probability is $O(1/\log N)$, where $N$ is the number of vertices. This matches the performance achieved by algorithms that use other forms of quantum walks.

APA, Harvard, Vancouver, ISO, and other styles

31

Dereniowski, Dariusz, and Dorota Osula. "On-line Search in Two-Dimensional Environment." Theory of Computing Systems 63, no. 8 (September 11, 2019): 1819–48. http://dx.doi.org/10.1007/s00224-019-09948-6.

Full text

Abstract:

Abstract We consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph that is guaranteed to be free of the fugitive is connected and whenever some node gains a property that it cannot be occupied by the fugitive, the strategy must operate in such a way to keep this property till its end. As a way of modeling two-dimensional shapes, we restrict our attention to networks that are embedded into partial grids: nodes are placed on the plane at integer coordinates and only nodes at distance one can be adjacent. Agents do not have any knowledge about the graph a priori, but they recognize the direction of the incident edge (up, down, left or right). We give an on-line algorithm for the searchers that allows them to compute a connected and monotone strategy that guarantees searching any unknown partial grid with the use of $O(\sqrt {n})$ O ( n ) searchers, where n is the number of nodes in the grid. As for a lower bound, there exist partial grids that require ${\varOmega }(\sqrt {n})$ Ω ( n ) searchers. Moreover, we prove that for each on-line searching algorithm there is a partial grid that forces the algorithm to use ${\varOmega }(\sqrt {n})$ Ω ( n ) searchers but $O(\log n)$ O ( log n ) searchers are sufficient in the off-line scenario. This gives a lower bound on ${\varOmega }(\sqrt {n}/\log n)$ Ω ( n / log n ) in terms of achievable competitive ratio of any on-line algorithm.

APA, Harvard, Vancouver, ISO, and other styles

32

Klose, Maria, Diana Steger, Julian Fick, and Cordula Artelt. "Decrypting Log Data." Zeitschrift für Psychologie 230, no. 1 (January 2022): 3–15. http://dx.doi.org/10.1027/2151-2604/a000484.

Full text

Abstract:

Abstract. Analyzing log data from digital learning environments provides information about online learning. However, it remains unclear how this information can be transferred to psychologically meaningful variables or how it is linked to learning outcomes. The present study summarizes findings on correlations between general online activity and learning outcomes in university settings. The course format, instructions to engage in online discussions, requirements, operationalization of general online activity, and publication year are considered moderators. A multi-source search provided 41 studies ( N = 28,986) reporting 69 independent samples and 104 effect sizes. The three-level random-effects meta-analysis identified a pooled effect of r = .25 p = .003, 95% CI [.09, .41], indicating that students who are more active online have better grades. Despite high heterogeneity, Q(103) = 3,960.04, p < .001, moderator analyses showed no statistically significant effect. We discuss further potential influencing factors in online courses and highlight the potential of learning analytics.

APA, Harvard, Vancouver, ISO, and other styles

33

Hale, Meredith L. "In Search of Art: A Log Analysis of the Ackland Art Museum’s Collection Search System." Art Documentation: Journal of the Art Libraries Society of North America 35, no. 2 (September 2016): 182–205. http://dx.doi.org/10.1086/688722.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

HAMADI, YOUSSEF, and MARC SHAPIRO. "PUSHING LOG-BASED RECONCILIATION." International Journal on Artificial Intelligence Tools 14, no. 03 (June 2005): 445–58. http://dx.doi.org/10.1142/s0218213005002193.

Full text

Abstract:

Optimistic reconciliation allows, multiple update of shared data without synchronization. The assumption is that the vast majority of the actions will not conflict. In these systems, write availability is raised in the presence of network failures, high latencies or parallel development. However, in order to remain consistent, optimistic systems repair divergences. To produce a new consistent state, they use the logs of each user in a process called log-based reconciliation. The purpose of an efficient reconciliation engine is then to compute a new consistent state which preserves the maximum of previous actions. This work leverages the efficiency of constraint-based reconciliation. It provides a new efficient two step procedure built by connecting theoretical results on backtrack-free search with this hard optimisation problem.

APA, Harvard, Vancouver, ISO, and other styles

35

Raab, Christian. "In Search of the Masculine Genius: The Contribution of Walter J. Ong." Logos: A Journal of Catholic Thought and Culture 21, no. 1 (2018): 83–117. http://dx.doi.org/10.1353/log.2018.0004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

FALCONER, SEAN M., and BRADFORD G. NICKERSON. "ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH." International Journal of Computational Geometry & Applications 15, no. 06 (December 2005): 565–73. http://dx.doi.org/10.1142/s0218195905001853.

Full text

Abstract:

We investigate an implementation of the multi-level or ℓ-level k-range data structure. The ℓ-level k-range is compared to naive and R*tree search over N randomly generated k-dimensional points. Results indicate that multi-level k-ranges are not competitive due to their (previously unreported) complexity. We show that storage is S(N,k,ℓ) = O(N1+2(k-1)/ℓ) and S(N,k) = Θ(N1+2(k-1)/ log 2N). Our results also indicate that the ℓ-level k-range requires Q(N,k,ℓ) = O((2ℓ)k( log N + A)) time for range search, for A = number of points reported in range.

APA, Harvard, Vancouver, ISO, and other styles

37

Hong, Yuan, Jaideep Vaidya, Haibing Lu, Panagiotis Karras, and Sanjay Goel. "Collaborative Search Log Sanitization: Toward Differential Privacy and Boosted Utility." IEEE Transactions on Dependable and Secure Computing 12, no. 5 (September 1, 2015): 504–18. http://dx.doi.org/10.1109/tdsc.2014.2369034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

White, Ryen W., Sheng Wang, Apurv Pant, Rave Harpaz, Pushpraj Shukla, Walter Sun, William DuMouchel, and Eric Horvitz. "Early identification of adverse drug reactions from search log data." Journal of Biomedical Informatics 59 (February 2016): 42–48. http://dx.doi.org/10.1016/j.jbi.2015.11.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Zhang, Ying, Bernard J. Jansen, and Amanda Spink. "Time series analysis of a Web search engine transaction log." Information Processing & Management 45, no. 2 (March 2009): 230–45. http://dx.doi.org/10.1016/j.ipm.2008.07.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Jiang, Di, Yongxin Tong, and Yuanfeng Song. "Cross-Lingual Topic Discovery From Multilingual Search Engine Query Log." ACM Transactions on Information Systems 35, no. 2 (December 21, 2016): 1–28. http://dx.doi.org/10.1145/2956235.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Silverstein, Craig, Hannes Marais, Monika Henzinger, and Michael Moricz. "Analysis of a very large web search engine query log." ACM SIGIR Forum 33, no. 1 (September 1999): 6–12. http://dx.doi.org/10.1145/331403.331405.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Hagerup, Torben. "Planar Depth-First Search in $O(\log n)$ Parallel Time." SIAM Journal on Computing 19, no. 4 (August 1990): 678–704. http://dx.doi.org/10.1137/0219047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Zycinski, Jozef. "Between Mathematics and Transcendence: The Search for the Spiritual Dimension of Scientific Discovery." Logos: A Journal of Catholic Thought and Culture 6, no. 2 (2003): 38–45. http://dx.doi.org/10.1353/log.2003.0028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

FLEISCHER, RUDOLF. "A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME." International Journal of Foundations of Computer Science 07, no. 02 (June 1996): 137–49. http://dx.doi.org/10.1142/s0129054196000117.

Full text

Abstract:

In this paper we show how a slight modification of (a, 2b)-trees allows us to perform member and neighbor queries in O( log n) time and updates in O(1) worst-case time (once the position of the inserted or deleted key is known). Our data structure is quite natural and much simpler than previous worst-case optimal solutions. It is based on two techniques : 1) bucketing, i.e., storing an ordered list of 2 log n keys in each leaf of an (a, 2b) tree, and 2) preventive splitting, i.e., splitting nodes before they can grow bigger than allowed. If only insertions are allowed, it can also be used as a finger search tree with O( log * n) worst-case update time.

APA, Harvard, Vancouver, ISO, and other styles

45

Ullah, Mohib, Rafi Ullah Khan, Irfan Ullah Khan, Nida Aslam, Sumayh S. Aljameel, Muhammad Inam Ul Haq, and Muhammad Arshad Islam. "Profile Aware ObScure Logging (PaOSLo): A Web Search Privacy-Preserving Protocol to Mitigate Digital Traces." Security and Communication Networks 2022 (February 3, 2022): 1–13. http://dx.doi.org/10.1155/2022/2109024.

Full text

Abstract:

Web search querying is an inevitable activity of any Internet user. The web search engine (WSE) is the easiest way to search and retrieve data from the Internet. The WSE stores the user’s search queries to retrieve the personalized search result in a form of query log. A user often leaves digital traces and sensitive information in the query log. WSE is known to sell the query log to a third party to generate revenue. However, the release of the query log can compromise the security and privacy of a user. In this work, we propose a Profile Aware ObScure Logging (PaOSLo) Web search privacy-preserving protocol that mitigates the digital traces a user leaves in Web searching. PaOSLo systematically groups users based on profile similarity. The primary objective of this work is to evaluate the impact of the systematic group compared to random grouping. We first computed the similarity between the users’ profiles and then clustered them using the K-mean algorithm to group the users systematically. Unlikability and indistinguishability are the two dimensions in which we have measured the privacy of a user. To compute the impact of systematic grouping on a user’s privacy, we have experimented with and compared the performance of PaOSLo with modern distributed protocols like OSLo and UUP(e). Results show that, at the top degree of the ODP hierarchy, PaOSLo preserved 10% and 3% better profile privacy than the modern distributed protocols mentioned above. In addition, the PaOSLo has less profile exposure for any group size and at each degree of the ODP hierarchy.

APA, Harvard, Vancouver, ISO, and other styles

46

Zahera, Hamada M., Gamal F. El-Hady, and W. F. Abd El-Wahed. "Query Recommendation for Improving Search Engine Results." International Journal of Information Retrieval Research 1, no. 1 (January 2011): 45–52. http://dx.doi.org/10.4018/ijirr.2011010104.

Full text

Abstract:

As web contents grow, the importance of search engines become more critical and at the same time user satisfaction decreases. Query recommendation is a new approach to improve search results in web. In this paper a method is proposed that, given a query submitted to a search engine, suggests a list of queries that are related to the user input query. The related queries are based on previously issued queries, and can be issued by the user to the search engine to tune or redirect the search process. The proposed method is based on clustering processes in which groups of semantically similar queries are detected. The clustering process uses the content of historical preferences of users registered in the query log of the search engine. This facility provides queries that are related to the ones submitted by users in order to direct them toward their required information. This method not only discovers the related queries but also ranks them according to a similarity measure. The method has been evaluated using real data sets from the search engine query log.

APA, Harvard, Vancouver, ISO, and other styles

47

Tiwari, Ankita. "A Survey On Page Ranking And Search Engine For Query Log." International Journal for Research in Applied Science and Engineering Technology V, no. IX (September 30, 2017): 20–26. http://dx.doi.org/10.22214/ijraset.2017.9005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Chaudhari, Soniya P., Prof Hitesh Gupta, and S. J. Patil. "Review of Improvement of Web Search Based on Web Log File." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 3, no. 2 (October 30, 2012): 298–300. http://dx.doi.org/10.24297/ijct.v3i2b.2880.

Full text

Abstract:

In this paper we review various research of journal paper as Web Searching efficiency improvement. Some important method based on sequential pattern Mining. Some are based on supervised learning or unsupervised learning. And also used for other method such as Fuzzy logic and neural network

APA, Harvard, Vancouver, ISO, and other styles

49

Hider, Philip M. "Constructing an index of search goal redefinition through transaction log analysis." Journal of Documentation 63, no. 2 (March 13, 2007): 175–87. http://dx.doi.org/10.1108/00220410710737169.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Lee, Sung-Sook. "Trends of Web-based OPAC Search Behavior via Transaction Log Analysis." Journal of the Korean BIBLIA Society for library and Information Science 23, no. 2 (June 30, 2012): 209–33. http://dx.doi.org/10.14699/kbiblia.2012.23.2.209.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!