Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 Focused Crawling A New Approach to Topic-Specific Web Resource Discovery Soumen Chakrabarti IBM Almaden Joint work with: Martin van Den Berg (Xerox)

Similar presentations


Presentation on theme: "1 Focused Crawling A New Approach to Topic-Specific Web Resource Discovery Soumen Chakrabarti IBM Almaden Joint work with: Martin van Den Berg (Xerox)"— Presentation transcript:

1 1 Focused Crawling A New Approach to Topic-Specific Web Resource Discovery Soumen Chakrabarti IBM Almaden Joint work with: Martin van Den Berg (Xerox) Byron Dom (IBM) David Gibson (Berkeley) Funded by Global Web Solutions, IBM Atlanta

2 2 Portals and portholes  Popular search portals and directories  Useful for generic needs  Difficult to do serious research  Information needs of net-savvy users are getting very sophisticated  Relatively little business incentive  Need handmade specialty sites: portholes  Resource discovery must be personalized

3 3 Quote The emergence of portholes will be one of the major Internet trends of 1999. As people become more savvy users of the Net, they want things which are better focused on meeting their specific needs. We're going to see a whole lot more of this, and it's going to potentially erode the user base of some of the big portals. Jim Hake (Founder, Global Information Infrastructure Awards)

4 4 Quote The most interesting trend is the growing sense of natural limits, a recognition that covering a single galaxy can be more practical—and useful—than trying to cover the entire universe. Dan Gillmore (Tech Columnist, San Jose Mercury News)

5 5 Scenario  Disk drive research group wants to track magnetic surface technologies  Compiler research group wants to trawl the web for graduate student resumés  ____ wants to enhance his/her collection of bookmarks about ____ with prominent and relevant links  Virtual libraries like the Open Directory Project and the Mining Co.Open Directory ProjectMining Co.

6 6 Goal  Automatically construct a focused portal (porthole) containing resources that are  Relevant to the user’s focus of interest  Of high influence and quality  Collectively comprehensive

7 7 Tools at hand  Keyword search engines  Synonymy, polysemy  Abundance, lack of quality  Hand compiled topic directories  Labor intensive, subjective judgements  Resources automatically located using keyword search and link graph distillation  Dependence on large crawls and indices

8 8 Estimating popularity  Extensive research on social network theory  Wasserman and Faust  Hyperlink based  Large in-degree indicates popularity/authority  Not all votes are worth the same  Several similar ideas and refinements  Googol (Page and Brin) and HITS (Kleinberg)  CLEVER (Chakrabarti et al)  Topic distillation (Bharat and Henzinger)

9 9 Topic distillation overview  Given web graph and query  Search engine selects sub-graph  Expansion, pruning and edge weights  Nodes iteratively transfer authority to cited neighbors Search Engine Query The Web Selected subgraph

10 10 Preliminary approach  Use topic distillation for focused crawling  Each node in topic taxonomy is a query  Query is refined by trial-and-error  Topic distillation runs at each node  E.g.: European airlines  +swissair +iberia +klm

11 11

12 12 Query construction +“power suppl*” “switch* mode” smps -multiprocessor* “uninterrupt* power suppl*” +ups -parcel* /Companies/Electronics/Power_Supply

13 13 Query complexity  Complex queries (966 trials)  Average words 7.03  Average operators ( +*–" ) 4.34  Typical Alta Vista queries are much simpler [Silverstein, Henzinger, Marais and Moricz]  Average query words 2.35  Average operators ( +*–" ) 0.41  Forcibly adding a hub or authority node helped in 86% of the queries

14 14 Problems with preliminary approach  Difficulty of query construction  Dependence on large web crawl and index  System = crawler + index + distiller  Unreliability of keyword match  Engines differ significantly on a given query due to small overlap [Bharat and Bröder]  Narrow, arbitrary view of relevant subgraph  Topic model does not improve over time  Lack of output sensitivity

15 15 Output sensitivity  Say the goal is to find a comprehensive collection of recreational and competitive bicycling sites and pages  Ideally effort should scale with size of the result  Time spent crawling and indexing sites unrelated to the topic is wasted  Likewise, time that does not improve comprehensiveness is wasted

16 16 Proposed solution  Resource discovery system that can be customized to crawl for any topic by giving examples  Hypertext mining algorithms learn to recognize pages and sites about the given topic, and a measure of their goodness  Crawler has guidance hooks controlled by these two scores

17 17 Advantages  No need for query formulation—system learns from examples  No dependence on global crawls  Specialized, deep and up-to-date web exploration  Modest desktop hardware adequate

18 18 Administration scenario Taxonomy Editor Current Examples Suggested Additional Examples Drag

19 19 Relevance All Bus&EconRecreation CompaniesCycling Bike Shops Mt.Biking Clubs Arts... Path nodes Good nodes Subsumed nodes

20 20 Classification  How relevant is a document w.r.t. a class?  Supervised learning, filtering, classification, categorization  Many types of classifiers  Bayesian, nearest neighbor, rule-based  Hypertext  Both text and links are class-dependent clues  How to model link-based features?

21 21 Exploiting link features  c=class, t=text, N=neighbors  Text-only model: Pr[t|c]  Using neighbors’ text to judge my topic: Pr[t, t(N) | c]  Better model: Pr[t, c(N) | c]  Non-linear relaxation ?

22 22 Exploiting link features  c=class, t=text, N=neighbors  Text-only model: Pr[t|c]  Using neighbors’ text to judge my topic: Pr[t, t(N) | c]  Better model: Pr[t, c(N) | c]  Non-linear relaxation

23 23 Putting it together Taxonomy Database Taxonomy Editor Example Browser Crawl Database Hypertext Classifier (Learn) Topic Models Hypertext Classifier (Apply) Scheduler Workers Topic Distiller Feedback

24 24 Monitoring the crawler Time Relevance One URL Moving Average

25 25 RDBMS benefits  Multiple priority controls  Dynamically changing crawling strategies  Concurrency and crash recovery  Effective out-of-core computations  Ad-hoc crawl monitoring and tweaking  Synergy of scale

26 26 Measures of success  Harvest rate  What fraction of crawled pages are relevant  Robustness across seed sets  Separate crawls with random disjoint samples  Measure overlap in URLs and servers crawled  Measure agreement in best-rated resources  Evidence of non-trivial work  #Links from start set to the best resources

27 27 Harvest rate UnfocusedFocused

28 28 Crawl robustness URL OverlapServer Overlap Crawl A Crawl B

29 29 Top resources after one hour  Recreational and competitive cycling  http://www.truesport.com/Bike/links.htm http://www.truesport.com/Bike/links.htm  http://reality.sgi.com/employees/billh_hamp ton/jrvs/links.html http://reality.sgi.com/employees/billh_hamp ton/jrvs/links.html  http://www.acs.ucalgary.ca/~bentley/mark_ links.html http://www.acs.ucalgary.ca/~bentley/mark_ links.html  HIV/AIDS research and treatment  http://www.stopaids.org/Otherorgs.html http://www.stopaids.org/Otherorgs.html  http://www.iohk.com/UserPages/mlau/aidsi nfo.html http://www.iohk.com/UserPages/mlau/aidsi nfo.html  http://www.ahandyguide.com/cat1/a/a66.ht m http://www.ahandyguide.com/cat1/a/a66.ht m  Purer and better than root set

30 30

31 31

32 32 Distance to best resources Cycling: cooperativeMutual funds: competitive

33 33 Robustness of resource discovery  Sample disjoint sets of starting URL’s  Two separate crawls  Find best authorities  Order by rank  Find overlap in the top-rated resources

34 34 Future work  Harvest rate at different levels of taxonomy  By definition harvest rate is 1 for root node  Sociology of citations  Build a gigantic citation matrix for web topics  Further enhance resource finding skills  Semi-structured queries  Suspicious link neighborhoods, e.g., traffic radar manufacturer and auto insurance company

35 35 Related work  WebWatcher, HotList&ColdList  Filtering as post-processing, not acquisition  Fish search, WebCrawler  Crawler guided by query keyword matches  Ahoy!, Cora  Hand-crafted to find home pages and papers  ReferralWeb  Social network on the Web

36 36 Conclusion  New architecture for example-driven topic- specific web resource discovery  No dependence on full web crawl and index  Modest desktop hardware adequate  Variable radius goal-directed crawling  High harvest rate  High quality resources found far from keyword query response nodes

37 37 References  soumen@cs.berkeley.edu  www.cs.berkeley.edu/~soumen/  www8focus.pdf  sigmod98.ps  www.almaden.ibm.com/cs/k53/ir.html


Download ppt "1 Focused Crawling A New Approach to Topic-Specific Web Resource Discovery Soumen Chakrabarti IBM Almaden Joint work with: Martin van Den Berg (Xerox)"

Similar presentations


Ads by Google