3,402 Hits in 2.8 sec

Exploring Technical Phrase Frames from Research Paper Titles

Yuzana Win, Tomonari Masada
2015 2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops  
Our method, first of all, extracts word trigrams from research paper titles and constructs a co-occurrence graph of the trigrams.  ...  This paper proposes a method for exploring technical phrase frames by extracting word n-grams that match our information needs and interests from research paper titles.  ...  topics and thus are useful in research information search.  ... 
doi:10.1109/waina.2015.37 dblp:conf/aina/WinM15 fatcat:vkfbnzni6zbotgi4avch24fvs4

Towards Supporting Exploratory Search over the Arabic Web Content: The Case of ArabXplore

Al-Agha Iyad, Abed Ahmed
2020 Journal of Information Technology Management  
Entities are then filtered and ranked by using a novel ranking algorithm that extends the conventional PageRank algorithm.  ...  Several efforts have been proposed to support exploratory search on the web by using query expansion, faceted search, or supplementary information extracted from external knowledge resources.  ...  Extracted terms are then ranked by using a novel ranking algorithm that extends the well-known PageRank algorithm.  ... 
doi:10.22059/jitm.2020.303225.2535 doaj:67ff9afe16924a2ca175a0dcfb9175fc fatcat:frj4rdqs7vfzdpy6rusjvmdgdy

Topic-based PageRank on author cocitation networks

Ying Ding
2011 Journal of the American Society for Information Science and Technology  
This paper applied the extended LDA to calculate the topic distributions for authors and added them to the weighted PageRank algorithm.  ...  number of unique 1-gram words extracted from paper titles excluding stop words.  ... 
doi:10.1002/asi.21467 fatcat:djz26kogkbbwxhhfstnqlgvp64

Object Oriented Information Computing over WWW [article]

Dr. Pushpa R. Suri, Harmunish Taneja
2011 arXiv   pre-print
Traditional search engines on World Wide Web (WWW) focus essentially on relevance ranking at the page level.  ...  PopRank extends the PageRank model by adding a popularity propagation factor (PPF) to each link pointing to an object, and uses different propagation factors for links of different types of relationships  ...  ranking and mining Model PageRank PopRank Search Less accurate More accurate Mining Conventional Intelligent Repository Web databases Object warehouses Advantages Ease of Use Ease of  ... 
arXiv:1107.3360v1 fatcat:nspw3us6z5fxnahzrmrnjem3yy

Extraction and Geographical Navigation of Important Historical Events in the Web [chapter]

Mitsuo Yamamoto, Yuku Takahashi, Hirotoshi Iwasaki, Satoshi Oyama, Hiroaki Ohshima, Katsumi Tanaka
2011 Lecture Notes in Computer Science  
We extend the PageRank algorithm to calculate the temporal and spatial impacts of entities.  ...  First, we develop a method for extracting information on the historical events from the Web and organizing it into a chronological table.  ...  We extended the PageRank algorithm to calculate the temporal and spatial impacts of entities.  ... 
doi:10.1007/978-3-642-19173-2_4 fatcat:rcg4plzsorcuvdubpx4cy37n4q

Concept-Aware Ranking: Teaching an Old Graph New Moves

Colin DeLong, Sandeep Mane, Jaideep Srivastava
2006 Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)  
By extracting keywords and recurring phrases from the anchor tag data, a set of concepts is defined.  ...  This is illustrated using webpages from the University of Minnesota's College of Liberal Arts websites.  ...  The authors would like to thank Prasanna Desikan and Nishith Pathak for peppering us with thoughtful questions, helping strengthen our reasoning in countless sections of this paper.  ... 
doi:10.1109/icdmw.2006.49 dblp:conf/icdm/DeLongMS06 fatcat:g2gtwf6frbh2bl5q2ktbnxyite

Research feature - Comparison of three vertical search spiders

M. Chau, Hsinchun Chen
2003 Computer  
For example, we can calculate the weight w h,i as a function of the number of words relevant to the target domain used in page h's anchor text linking to page i.  ...  Other research has extended the basic algorithm-for example, to factor in how much a node, based on its relevance, influences its neighbors. 4 Like PageRank, HITS calculates its scores iteratively and  ... 
doi:10.1109/mc.2003.1198237 fatcat:hl5pa56uybd3zfuemvebh5pcja

Ignoring Irrelevant Pages in Weighted PageRank Algorithm using Text Content of the Target Page

Sunil Kumar, Niraj Singhal
2014 International Journal of Computer Applications  
This paper presents a novel approach to ignore irrelevant pages in weighted pagerank algorithm using text content of the targeted pages.  ...  Degree of quality of the information extracted is one of the major issue to be taken care of, and current information retrieval approaches need to be modified to meet such challenges.  ...  In the same way, one can calculate the effective weight of each term in a document and store it in the inverted word document table [24] against the corresponding word with the document information in  ... 
doi:10.5120/14806-3014 fatcat:w7qzzfuav5gfnotf2ut37kl4hy

Page Ranking Algorithms for Web Mining

Rekha Jain, Dr. G. N. Purohit
2011 International Journal of Computer Applications  
In this paper we discuss and compare the commonly used algorithms i.e.  ...  Web mining technique is used to categorize users and pages by analyzing users behavior, the content of pages and order of URLs accessed. Web Structure Mining plays an important role in this approach.  ...  PageRank This algorithm was developed by Brin and Page at Stanford University which extends the idea of citation analysis [5] .  ... 
doi:10.5120/1775-2448 fatcat:i73oqevoazerxixefnwqrmkxky

An Enhanced Fuzzy Clustering and Expectation Maximization Framework based Matching Semantically Similar Sentences

M. Uma Devi, G. Meera Gandhi
2015 Procedia Computer Science  
Statistical measure of finding Similar Sentences using a novel Fuzzy clustering algorithm framework is developed which organizes text from one or more documents into different clusters .  ...  Our Experimental results demonstrates that our method is capable of identifying the overlapping clusters of semantically related sentences, and can be used in a variety of text mining tasks.  ...  M and Meera Gandhi.G proposed a new method to find similar words by using Bag of Word (BOW) and Extended Entity Description (EDs) concept 12 .  ... 
doi:10.1016/j.procs.2015.07.406 fatcat:f625iscosbasxbyagplsmk3rl4

PositionRank: An Unsupervised Approach to Keyphrase Extraction from Scholarly Documents

Corina Florescu, Cornelia Caragea
2017 Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)  
Our model obtains remarkable improvements in performance over PageRank models that do not take into account word positions as well as over strong baselines for this task.  ...  In this paper, we propose PositionRank, an unsupervised model for keyphrase extraction from scholarly documents that incorporates information from all positions of a word's occurrences into a biased PageRank  ...  Lee Giles for the Cite-SeerX data that we used to create our KDD and WWW datasets as well as to train the topic models.  ... 
doi:10.18653/v1/p17-1102 dblp:conf/acl/FlorescuC17 fatcat:pmh5n6zcvbdkpmjufxfftrnj5q

An Rdf Metadata-Based Weighted Semantic Pagerank Algorithm

Hee-Gook Jun
2016 Zenodo  
We extract semantic metadata from Web pages and construct a semantic-link-based Web structure using RDF model.  ...  The results of our experiment show that our approach outperforms existing PageRank algorithms.  ...  WSPR 0.85 0.61 0.37 0.22 C 1. 22 B 0.61 A 0.2 2 Calculate rank value for each Resource PageRank value based on ResourceRank score RDF Parsing Extracted RDF data <h3 property=  ... 
doi:10.5281/zenodo.1209579 fatcat:vttpnputlrf3jd5br6c6hobniq

An Optimized Page Rank Algorithm With Web Mining, Web Content Mining And Web Structure Mining

Kwame Boakye Agyapong, Dr. J.B.Hayfron-Acquah, Dr. M. Asante
2017 Zenodo  
In order to achieve this goal, they use the concept of web mining.  ...  Most of the search engines are ranking their search results in response to users' queries to make their search navigation easier.  ...  Term extraction procedure includes the following sub procedures: Tokenization, Normalization, Stemming and Stop word handling.  ... 
doi:10.5281/zenodo.914659 fatcat:c45milwkcvhxxhdwgf4ucdvxiy

Web Structure Mining: Exploring Hyperlinks and Algorithms for Information Retrieval

2010 American Journal of Applied Sciences  
The different algorithms used for Link analysis like PageRank, HITS (Hyperlink-Induced Topic Search) and other algorithms will be discussed and compared.  ...  This paper focus on the Hyperlink analysis, the algorithms used for link analysis, compare those algorithms and the role of hyperlink analysis in Web searching.  ...  HYPERLINK ANALYSIS Many Web Pages do not include words that are descriptive of their basic purpose (for example rarely a search engine portal includes the word "search" in its home page), and there exist  ... 
doi:10.3844/ajassp.2010.840.845 fatcat:oxhjxpggbfh4bfdvzps6sw4x44

Link spam target detection using page farms

Bin Zhou, Jian Pei
2009 ACM Transactions on Knowledge Discovery from Data  
The naïve greedy search method is much slower. Extracting one page using the naïve greedy search method on average needs 1, 742 seconds.  ...  The method potentially can be extended to extracting page farms for all pages in the whole Web graph. -We investigate link spam detection using page farms, as shown in Section 4.  ... 
doi:10.1145/1552303.1552306 fatcat:67ujkjzlmzdufd2eigv52ajiky
« Previous Showing results 1 — 15 out of 3,402 results