Extended Boolean model - Revision history

OAbot: Open access bot: url-access updated in citation with #oabot.

2025-05-24T00:27:24Z

Open access bot: url-access updated in citation with #oabot.

← Previous revision		Revision as of 00:27, 24 May 2025
Line 67:		Line 67:

	==Further reading==		==Further reading==
	* {{citation \|url=https://www.sciencedirect.com/science/article/abs/pii/S0306457305000713 \|doi=10.1016/j.ipm.2005.05.009 \|title=Adaptive relevance feedback method of extended Boolean model using hierarchical clustering techniques \|journal=Information Processing & Management \|date=March 2006 \|volume=42 \|issue=2 \|pages=331–349 \|last1=Choi \|first1=Jongpill \|last2=Kim \|first2=Minkoo \|last3=Raghavan \|first3=Vijay V. }}		* {{citation \|url=https://www.sciencedirect.com/science/article/abs/pii/S0306457305000713 \|doi=10.1016/j.ipm.2005.05.009 \|title=Adaptive relevance feedback method of extended Boolean model using hierarchical clustering techniques \|journal=Information Processing & Management \|date=March 2006 \|volume=42 \|issue=2 \|pages=331–349 \|last1=Choi \|first1=Jongpill \|last2=Kim \|first2=Minkoo \|last3=Raghavan \|first3=Vijay V. \|url-access=subscription }}
	* {{citation \|url=http://www.sciencedirect.com/science/article/pii/S0306457302000237 \|doi=10.1016/S0306-4573(02)00023-7 \|title=Interpolation of the extended Boolean retrieval model \|journal=Information Processing & Management \|date=November 2002 \|volume=38 \|issue=6 \|pages=743–748 \|last1=Zanger \|first1=Daniel Z. }}		* {{citation \|url=http://www.sciencedirect.com/science/article/pii/S0306457302000237 \|doi=10.1016/S0306-4573(02)00023-7 \|title=Interpolation of the extended Boolean retrieval model \|journal=Information Processing & Management \|date=November 2002 \|volume=38 \|issue=6 \|pages=743–748 \|last1=Zanger \|first1=Daniel Z. \|url-access=subscription }}
	* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| access-date=2017-09-09 \| archive-date=2013-09-28 \| archive-url=https://web.archive.org/web/20130928060217/http://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| url-status=dead }}		* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| access-date=2017-09-09 \| archive-date=2013-09-28 \| archive-url=https://web.archive.org/web/20130928060217/http://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| url-status=dead }}
	* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 \| hdl-access=free }}		* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 \| hdl-access=free }}

Josve05a: /* Further reading */ | Add: pages, issue, volume, date, journal, title, doi, authors 1-1. | Use this tool. Report bugs. | #UCB_Gadget

2024-09-10T18:31:26Z

Further reading: | Add: pages, issue, volume, date, journal, title, doi, authors 1-1. | Use this tool. Report bugs. | #UCB_Gadget

← Previous revision		Revision as of 18:31, 10 September 2024
Line 67:		Line 67:

	==Further reading==		==Further reading==
	* {{~~cite~~ ~~journal~~\|url=https://www.sciencedirect.com/science/article/abs/pii/S0306457305000713 \|doi=10.1016/j.ipm.2005.05.009 \|title=Adaptive relevance feedback method of extended Boolean model using hierarchical clustering techniques \|journal=Information Processing & Management \|date=March 2006 \|volume=42 \|issue=2 \|pages=331–349 \|last1=Choi \|first1=Jongpill \|last2=Kim \|first2=Minkoo \|last3=Raghavan \|first3=Vijay V. }}		* {{citation \|url=https://www.sciencedirect.com/science/article/abs/pii/S0306457305000713 \|doi=10.1016/j.ipm.2005.05.009 \|title=Adaptive relevance feedback method of extended Boolean model using hierarchical clustering techniques \|journal=Information Processing & Management \|date=March 2006 \|volume=42 \|issue=2 \|pages=331–349 \|last1=Choi \|first1=Jongpill \|last2=Kim \|first2=Minkoo \|last3=Raghavan \|first3=Vijay V. }}
			* {{citation \|url=http://www.sciencedirect.com/science/article/pii/S0306457302000237 \|doi=10.1016/S0306-4573(02)00023-7 \|title=Interpolation of the extended Boolean retrieval model \|journal=Information Processing & Management \|date=November 2002 \|volume=38 \|issue=6 \|pages=743–748 \|last1=Zanger \|first1=Daniel Z. }}
	* [https://archive.today/20130201225202/http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VC8-454T5MS-2&_user=513551&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1117914301&_rerunOrigin=google&_acct=C000025338&_version=1&_urlVersion=0&_userid=513551&md5=4eab0da46bfe361afa883e48f2060feb Interpolation of the extended Boolean retrieval model ]
	* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| access-date=2017-09-09 \| archive-date=2013-09-28 \| archive-url=https://web.archive.org/web/20130928060217/http://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| url-status=dead }}		* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| access-date=2017-09-09 \| archive-date=2013-09-28 \| archive-url=https://web.archive.org/web/20130928060217/http://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| url-status=dead }}
	* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 \| hdl-access=free }}		* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 \| hdl-access=free }}

Josve05a: /* Further reading */

2024-09-10T18:30:36Z

InternetArchiveBot: Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5

2024-03-24T02:31:57Z

Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5

← Previous revision		Revision as of 02:31, 24 March 2024
Line 69:		Line 69:
	* [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.1997 Adaptive Feedback Methods in an Extended Boolean Model by Dr.Jongpill Choi]		* [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.1997 Adaptive Feedback Methods in an Extended Boolean Model by Dr.Jongpill Choi]
	* [https://archive.today/20130201225202/http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VC8-454T5MS-2&_user=513551&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1117914301&_rerunOrigin=google&_acct=C000025338&_version=1&_urlVersion=0&_userid=513551&md5=4eab0da46bfe361afa883e48f2060feb Interpolation of the extended Boolean retrieval model ]		* [https://archive.today/20130201225202/http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VC8-454T5MS-2&_user=513551&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1117914301&_rerunOrigin=google&_acct=C000025338&_version=1&_urlVersion=0&_userid=513551&md5=4eab0da46bfe361afa883e48f2060feb Interpolation of the extended Boolean retrieval model ]
	* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes}}		* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| access-date=2017-09-09 \| archive-date=2013-09-28 \| archive-url=https://web.archive.org/web/20130928060217/http://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| url-status=dead }}
	* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 \| hdl-access=free }}		* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 \| hdl-access=free }}

MewTheEditor: /* Examples */

2023-02-21T22:09:34Z

Examples

← Previous revision		Revision as of 22:09, 21 February 2023
Line 58:		Line 58:
	Consider the query {{math\|''q'' {{=}} (''K''<sub>1</sub> &and; ''K''<sub>2</sub>) &or; ''K''<sub>3</sub>}}. The similarity between query {{math\|''q''}} and document {{math\|''d''}} can be computed using the formula:		Consider the query {{math\|''q'' {{=}} (''K''<sub>1</sub> &and; ''K''<sub>2</sub>) &or; ''K''<sub>3</sub>}}. The similarity between query {{math\|''q''}} and document {{math\|''d''}} can be computed using the formula:

	<math>sim(q,d)=\sqrt[p]{\frac{(1-\sqrt[p]{(\frac{(1-w_1)^p+(1-w_2)^p}{2}}))^p+w_3^p}{t}}</math>		<math>sim(q,d)=\sqrt[p]{\frac{(1-\sqrt[p]{(\frac{(1-w_1)^p+(1-w_2)^p}{2}}))^p+w_3^p}{2}}</math>

	==Improvements over the Standard Boolean Model==		==Improvements over the Standard Boolean Model==

Citation bot: Add: s2cid. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_CommandLine

2022-11-10T20:12:40Z

Add: s2cid. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_CommandLine

← Previous revision		Revision as of 20:12, 10 November 2022
Line 1:		Line 1:
	The '''Extended Boolean model''' was described in a Communications of the ACM article appearing in 1983, by Gerard Salton, Edward A. Fox, and Harry Wu. The goal of the Extended Boolean model is to overcome the drawbacks of the Boolean model that has been used in [[information retrieval]]. The Boolean model doesn't consider term weights in queries, and the result set of a Boolean query is often either too small or too big. The idea of the extended model is to make use of partial matching and term weights as in the vector space model. It combines the characteristics of the [[Vector Space Model]] with the properties of [[Boolean algebra (logic)\|Boolean algebra]] and ranks the similarity between queries and documents. This way a document may be somewhat relevant if it matches some of the queried terms and will be returned as a result, whereas in the [[Standard Boolean model]] it wasn't.<ref>		The '''Extended Boolean model''' was described in a Communications of the ACM article appearing in 1983, by Gerard Salton, Edward A. Fox, and Harry Wu. The goal of the Extended Boolean model is to overcome the drawbacks of the Boolean model that has been used in [[information retrieval]]. The Boolean model doesn't consider term weights in queries, and the result set of a Boolean query is often either too small or too big. The idea of the extended model is to make use of partial matching and term weights as in the vector space model. It combines the characteristics of the [[Vector Space Model]] with the properties of [[Boolean algebra (logic)\|Boolean algebra]] and ranks the similarity between queries and documents. This way a document may be somewhat relevant if it matches some of the queried terms and will be returned as a result, whereas in the [[Standard Boolean model]] it wasn't.<ref>
	{{citation \| last1=Salton \| first1=Gerard \| first2=Edward A. \| last2=Fox \| first3= Harry \| last3=Wu \| title=Extended Boolean information retrieval \| journal=Communications of the ACM \| volume=26 \| issue=11 \| pages=1022–1036 \| publisher=Communications of the ACM, Volume 26, Issue 11 \| year=1983 \| doi=10.1145/182.358466 \| hdl=1813/6351 \| hdl-access=free }}</ref>		{{citation \| last1=Salton \| first1=Gerard \| first2=Edward A. \| last2=Fox \| first3= Harry \| last3=Wu \| title=Extended Boolean information retrieval \| journal=Communications of the ACM \| volume=26 \| issue=11 \| pages=1022–1036 \| publisher=Communications of the ACM, Volume 26, Issue 11 \| year=1983 \| doi=10.1145/182.358466 \| hdl=1813/6351 \| s2cid=207180535 \| hdl-access=free }}</ref>

	Thus, the extended Boolean model can be considered as a generalization of both the Boolean and vector space models; those two are special cases if suitable settings and definitions are employed. Further, research has shown effectiveness improves relative to that for Boolean query processing. Other research has shown that [[relevance feedback]] and [[query expansion]] can be integrated with extended Boolean query processing.		Thus, the extended Boolean model can be considered as a generalization of both the Boolean and vector space models; those two are special cases if suitable settings and definitions are employed. Further, research has shown effectiveness improves relative to that for Boolean query processing. Other research has shown that [[relevance feedback]] and [[query expansion]] can be integrated with extended Boolean query processing.

79.140.210.50 at 15:19, 4 December 2021

2021-12-04T15:19:32Z

← Previous revision		Revision as of 15:19, 4 December 2021
Line 58:		Line 58:
	Consider the query {{math\|''q'' {{=}} (''K''<sub>1</sub> &and; ''K''<sub>2</sub>) &or; ''K''<sub>3</sub>}}. The similarity between query {{math\|''q''}} and document {{math\|''d''}} can be computed using the formula:		Consider the query {{math\|''q'' {{=}} (''K''<sub>1</sub> &and; ''K''<sub>2</sub>) &or; ''K''<sub>3</sub>}}. The similarity between query {{math\|''q''}} and document {{math\|''d''}} can be computed using the formula:

	<math>sim(q,d)=\sqrt[p]{\frac{(1-\sqrt[p]{(\frac{(1-w_1)^p+(1-w_2)^p}{2}}))^p+w_3^p}{2}}</math>		<math>sim(q,d)=\sqrt[p]{\frac{(1-\sqrt[p]{(\frac{(1-w_1)^p+(1-w_2)^p}{2}}))^p+w_3^p}{t}}</math>

	==Improvements over the Standard Boolean Model==		==Improvements over the Standard Boolean Model==

OAbot: Open access bot: hdl added to citation with #oabot.

2020-04-18T11:29:11Z

Open access bot: hdl added to citation with #oabot.

← Previous revision		Revision as of 11:29, 18 April 2020
Line 1:		Line 1:
	The '''Extended Boolean model''' was described in a Communications of the ACM article appearing in 1983, by Gerard Salton, Edward A. Fox, and Harry Wu. The goal of the Extended Boolean model is to overcome the drawbacks of the Boolean model that has been used in [[information retrieval]]. The Boolean model doesn't consider term weights in queries, and the result set of a Boolean query is often either too small or too big. The idea of the extended model is to make use of partial matching and term weights as in the vector space model. It combines the characteristics of the [[Vector Space Model]] with the properties of [[Boolean algebra (logic)\|Boolean algebra]] and ranks the similarity between queries and documents. This way a document may be somewhat relevant if it matches some of the queried terms and will be returned as a result, whereas in the [[Standard Boolean model]] it wasn't.<ref>		The '''Extended Boolean model''' was described in a Communications of the ACM article appearing in 1983, by Gerard Salton, Edward A. Fox, and Harry Wu. The goal of the Extended Boolean model is to overcome the drawbacks of the Boolean model that has been used in [[information retrieval]]. The Boolean model doesn't consider term weights in queries, and the result set of a Boolean query is often either too small or too big. The idea of the extended model is to make use of partial matching and term weights as in the vector space model. It combines the characteristics of the [[Vector Space Model]] with the properties of [[Boolean algebra (logic)\|Boolean algebra]] and ranks the similarity between queries and documents. This way a document may be somewhat relevant if it matches some of the queried terms and will be returned as a result, whereas in the [[Standard Boolean model]] it wasn't.<ref>
	{{citation \| last1=Salton \| first1=Gerard \| first2=Edward A. \| last2=Fox \| first3= Harry \| last3=Wu \| title=Extended Boolean information retrieval \| journal=Communications of the ACM \| volume=26 \| issue=11 \| pages=1022–1036 \| publisher=Communications of the ACM, Volume 26, Issue 11 \| year=1983 \| doi=10.1145/182.358466 \| hdl=1813/6351 }}</ref>		{{citation \| last1=Salton \| first1=Gerard \| first2=Edward A. \| last2=Fox \| first3= Harry \| last3=Wu \| title=Extended Boolean information retrieval \| journal=Communications of the ACM \| volume=26 \| issue=11 \| pages=1022–1036 \| publisher=Communications of the ACM, Volume 26, Issue 11 \| year=1983 \| doi=10.1145/182.358466 \| hdl=1813/6351 \| hdl-access=free }}</ref>

	Thus, the extended Boolean model can be considered as a generalization of both the Boolean and vector space models; those two are special cases if suitable settings and definitions are employed. Further, research has shown effectiveness improves relative to that for Boolean query processing. Other research has shown that [[relevance feedback]] and [[query expansion]] can be integrated with extended Boolean query processing.		Thus, the extended Boolean model can be considered as a generalization of both the Boolean and vector space models; those two are special cases if suitable settings and definitions are employed. Further, research has shown effectiveness improves relative to that for Boolean query processing. Other research has shown that [[relevance feedback]] and [[query expansion]] can be integrated with extended Boolean query processing.
Line 70:		Line 70:
	* [https://archive.today/20130201225202/http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VC8-454T5MS-2&_user=513551&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1117914301&_rerunOrigin=google&_acct=C000025338&_version=1&_urlVersion=0&_userid=513551&md5=4eab0da46bfe361afa883e48f2060feb Interpolation of the extended Boolean retrieval model ]		* [https://archive.today/20130201225202/http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VC8-454T5MS-2&_user=513551&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1117914301&_rerunOrigin=google&_acct=C000025338&_version=1&_urlVersion=0&_userid=513551&md5=4eab0da46bfe361afa883e48f2060feb Interpolation of the extended Boolean retrieval model ]
	* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes}}		* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes}}
	* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 }}		* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 \| hdl-access=free }}

	==See also==		==See also==

Monkbot: /* The 2 Dimensions Example */Task 16: replaced (1×) / removed (0×) deprecated |dead-url= and |deadurl= with |url-status=;

2019-10-02T21:43:51Z

The 2 Dimensions Example: Task 16: replaced (1×) / removed (0×) deprecated |dead-url= and |deadurl= with |url-status=;

← Previous revision		Revision as of 21:43, 2 October 2019
Line 30:		Line 30:
	}}		}}

	Considering the space composed of two terms {{math\|''K<sub>x</sub>''}} and {{math\|''K<sub>y</sub>''}} only, the corresponding term weights are {{math\|''w''<sub>1</sub>}} and {{math\|''w''<sub>2</sub>}}.<ref>{{Cite web \|url=http://www.cs.cityu.edu.hk/~cs5286/Lectures/Lwang.ppt \|title=Lusheng Wang \|access-date=2009-12-01 \|archive-url=https://web.archive.org/web/20110927143924/http://www.cs.cityu.edu.hk/~cs5286/Lectures/Lwang.ppt \|archive-date=2011-09-27 \|~~dead-~~url=~~yes~~ }}</ref> Thus, for query {{math\|''q<sub>or</sub>'' {{=}} (''K<sub>x</sub>'' &or; ''K<sub>y</sub>'')}}, we can calculate the similarity with the following formula:		Considering the space composed of two terms {{math\|''K<sub>x</sub>''}} and {{math\|''K<sub>y</sub>''}} only, the corresponding term weights are {{math\|''w''<sub>1</sub>}} and {{math\|''w''<sub>2</sub>}}.<ref>{{Cite web \|url=http://www.cs.cityu.edu.hk/~cs5286/Lectures/Lwang.ppt \|title=Lusheng Wang \|access-date=2009-12-01 \|archive-url=https://web.archive.org/web/20110927143924/http://www.cs.cityu.edu.hk/~cs5286/Lectures/Lwang.ppt \|archive-date=2011-09-27 \|url-status=dead }}</ref> Thus, for query {{math\|''q<sub>or</sub>'' {{=}} (''K<sub>x</sub>'' &or; ''K<sub>y</sub>'')}}, we can calculate the similarity with the following formula:

	<math>sim(q_{or},d)=\sqrt{\frac{w_1^2+w_2^2}{2}}</math>		<math>sim(q_{or},d)=\sqrt{\frac{w_1^2+w_2^2}{2}}</math>

InternetArchiveBot: Rescuing 1 sources and tagging 0 as dead. #IABot (v2.0beta15)

2019-08-14T14:57:47Z

Rescuing 1 sources and tagging 0 as dead. #IABot (v2.0beta15)

← Previous revision		Revision as of 14:57, 14 August 2019
Line 30:		Line 30:
	}}		}}

	Considering the space composed of two terms {{math\|''K<sub>x</sub>''}} and {{math\|''K<sub>y</sub>''}} only, the corresponding term weights are {{math\|''w''<sub>1</sub>}} and {{math\|''w''<sub>2</sub>}}.<ref>[http://www.cs.cityu.edu.hk/~cs5286/Lectures/Lwang.ppt Lusheng Wang]</ref> Thus, for query {{math\|''q<sub>or</sub>'' {{=}} (''K<sub>x</sub>'' &or; ''K<sub>y</sub>'')}}, we can calculate the similarity with the following formula:		Considering the space composed of two terms {{math\|''K<sub>x</sub>''}} and {{math\|''K<sub>y</sub>''}} only, the corresponding term weights are {{math\|''w''<sub>1</sub>}} and {{math\|''w''<sub>2</sub>}}.<ref>{{Cite web \|url=http://www.cs.cityu.edu.hk/~cs5286/Lectures/Lwang.ppt \|title=Lusheng Wang \|access-date=2009-12-01 \|archive-url=https://web.archive.org/web/20110927143924/http://www.cs.cityu.edu.hk/~cs5286/Lectures/Lwang.ppt \|archive-date=2011-09-27 \|dead-url=yes }}</ref> Thus, for query {{math\|''q<sub>or</sub>'' {{=}} (''K<sub>x</sub>'' &or; ''K<sub>y</sub>'')}}, we can calculate the similarity with the following formula:

	<math>sim(q_{or},d)=\sqrt{\frac{w_1^2+w_2^2}{2}}</math>		<math>sim(q_{or},d)=\sqrt{\frac{w_1^2+w_2^2}{2}}</math>

← Previous revision		Revision as of 00:27, 24 May 2025
Line 67:		Line 67:

	==Further reading==		==Further reading==
	* {{citation \|url=https://www.sciencedirect.com/science/article/abs/pii/S0306457305000713 \|doi=10.1016/j.ipm.2005.05.009 \|title=Adaptive relevance feedback method of extended Boolean model using hierarchical clustering techniques \|journal=Information Processing & Management \|date=March 2006 \|volume=42 \|issue=2 \|pages=331–349 \|last1=Choi \|first1=Jongpill \|last2=Kim \|first2=Minkoo \|last3=Raghavan \|first3=Vijay V. }}		* {{citation \|url=https://www.sciencedirect.com/science/article/abs/pii/S0306457305000713 \|doi=10.1016/j.ipm.2005.05.009 \|title=Adaptive relevance feedback method of extended Boolean model using hierarchical clustering techniques \|journal=Information Processing & Management \|date=March 2006 \|volume=42 \|issue=2 \|pages=331–349 \|last1=Choi \|first1=Jongpill \|last2=Kim \|first2=Minkoo \|last3=Raghavan \|first3=Vijay V. \|url-access=subscription }}
	* {{citation \|url=http://www.sciencedirect.com/science/article/pii/S0306457302000237 \|doi=10.1016/S0306-4573(02)00023-7 \|title=Interpolation of the extended Boolean retrieval model \|journal=Information Processing & Management \|date=November 2002 \|volume=38 \|issue=6 \|pages=743–748 \|last1=Zanger \|first1=Daniel Z. }}		* {{citation \|url=http://www.sciencedirect.com/science/article/pii/S0306457302000237 \|doi=10.1016/S0306-4573(02)00023-7 \|title=Interpolation of the extended Boolean retrieval model \|journal=Information Processing & Management \|date=November 2002 \|volume=38 \|issue=6 \|pages=743–748 \|last1=Zanger \|first1=Daniel Z. \|url-access=subscription }}
	* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| access-date=2017-09-09 \| archive-date=2013-09-28 \| archive-url=https://web.archive.org/web/20130928060217/http://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| url-status=dead }}		* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| access-date=2017-09-09 \| archive-date=2013-09-28 \| archive-url=https://web.archive.org/web/20130928060217/http://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| url-status=dead }}
	* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 \| hdl-access=free }}		* {{citation \| chapter=Experiments with Automatic Query Formulation in the Extended Boolean Model \| first1= Lucie \| title=Text, Speech and Dialogue \| volume=5729 \| pages=371–378 \| last1= Skorkovská \| first2=Pavel \| last2=Ircing \| year=2009 \| publisher= Springer Berlin / Heidelberg\| doi=10.1007/978-3-642-04208-9_51 \| series=Lecture Notes in Computer Science \| isbn=978-3-642-04207-2 \| hdl=11025/16985 \| hdl-access=free }}

← Previous revision		Revision as of 18:30, 10 September 2024
Line 67:		Line 67:

	==Further reading==		==Further reading==
			* {{cite journal\|url=https://www.sciencedirect.com/science/article/abs/pii/S0306457305000713 \|doi=10.1016/j.ipm.2005.05.009 \|title=Adaptive relevance feedback method of extended Boolean model using hierarchical clustering techniques \|journal=Information Processing & Management \|date=March 2006 \|volume=42 \|issue=2 \|pages=331–349 \|last1=Choi \|first1=Jongpill \|last2=Kim \|first2=Minkoo \|last3=Raghavan \|first3=Vijay V. }}
	* [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.1997 Adaptive Feedback Methods in an Extended Boolean Model by Dr.Jongpill Choi]
	* [https://archive.today/20130201225202/http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VC8-454T5MS-2&_user=513551&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1117914301&_rerunOrigin=google&_acct=C000025338&_version=1&_urlVersion=0&_userid=513551&md5=4eab0da46bfe361afa883e48f2060feb Interpolation of the extended Boolean retrieval model ]		* [https://archive.today/20130201225202/http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VC8-454T5MS-2&_user=513551&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1117914301&_rerunOrigin=google&_acct=C000025338&_version=1&_urlVersion=0&_userid=513551&md5=4eab0da46bfe361afa883e48f2060feb Interpolation of the extended Boolean retrieval model ]
	* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| access-date=2017-09-09 \| archive-date=2013-09-28 \| archive-url=https://web.archive.org/web/20130928060217/http://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| url-status=dead }}		* {{citation \| title=Information Retrieval: Algorithms and Data structures; Extended Boolean model \| last1=Fox \| first1=E. \| first2=S. \| last2=Betrabet \| first3=M. \| last3=Koushik \| first4=W. \| last4=Lee \| year=1992 \| publisher=Prentice-Hall, Inc. \| url=https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| access-date=2017-09-09 \| archive-date=2013-09-28 \| archive-url=https://web.archive.org/web/20130928060217/http://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes \| url-status=dead }}