HCV, a heuristic covering algorithm for extension matrix approach:
Abstract: "HCV is a heuristic attribute-based induction algorithm based on the extension matrix approach. By dividing the positive examples (PE) in a given example set into intersecting groups and adopting a set of strategies to find a heuristic conjunctive formula in each group which covers al...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1992
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
578 |
| Subjects: | |
| Summary: | Abstract: "HCV is a heuristic attribute-based induction algorithm based on the extension matrix approach. By dividing the positive examples (PE) in a given example set into intersecting groups and adopting a set of strategies to find a heuristic conjunctive formula in each group which covers all the positive examples in the group and none of the negative examples (NE), it can find a covering formula in form [sic] of variable- value logic for PE against NE in low-order polynomial time. This paper presents the algorithm in detail and provides a comparison of it with ID3, a representative of the decision tree method based family of inductive algorithms." |
| Physical Description: | 28 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010459397 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951031s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)31283408 | ||
| 035 | |a (DE-599)BVBBV010459397 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Wu, Xingdong |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a HCV, a heuristic covering algorithm for extension matrix approach |
| 264 | 1 | |a Edinburgh |c 1992 | |
| 300 | |a 28 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 578 | |
| 520 | 3 | |a Abstract: "HCV is a heuristic attribute-based induction algorithm based on the extension matrix approach. By dividing the positive examples (PE) in a given example set into intersecting groups and adopting a set of strategies to find a heuristic conjunctive formula in each group which covers all the positive examples in the group and none of the negative examples (NE), it can find a covering formula in form [sic] of variable- value logic for PE against NE in low-order polynomial time. This paper presents the algorithm in detail and provides a comparison of it with ID3, a representative of the decision tree method based family of inductive algorithms." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 4 | |a Induction (Logic) | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 578 |w (DE-604)BV010450646 |9 578 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006968428 | ||
Record in the Search Index
| _version_ | 1804124890427555840 |
|---|---|
| any_adam_object | |
| author | Wu, Xingdong |
| author_facet | Wu, Xingdong |
| author_role | aut |
| author_sort | Wu, Xingdong |
| author_variant | x w xw |
| building | Verbundindex |
| bvnumber | BV010459397 |
| ctrlnum | (OCoLC)31283408 (DE-599)BVBBV010459397 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01642nam a2200301 cb4500</leader><controlfield tag="001">BV010459397</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951031s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31283408</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010459397</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wu, Xingdong</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">HCV, a heuristic covering algorithm for extension matrix approach</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">578</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "HCV is a heuristic attribute-based induction algorithm based on the extension matrix approach. By dividing the positive examples (PE) in a given example set into intersecting groups and adopting a set of strategies to find a heuristic conjunctive formula in each group which covers all the positive examples in the group and none of the negative examples (NE), it can find a covering formula in form [sic] of variable- value logic for PE against NE in low-order polynomial time. This paper presents the algorithm in detail and provides a comparison of it with ID3, a representative of the decision tree method based family of inductive algorithms."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Induction (Logic)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">578</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">578</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006968428</subfield></datafield></record></collection> |
| id | DE-604.BV010459397 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:51Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006968428 |
| oclc_num | 31283408 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 28 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Wu, Xingdong Verfasser aut HCV, a heuristic covering algorithm for extension matrix approach Edinburgh 1992 28 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 578 Abstract: "HCV is a heuristic attribute-based induction algorithm based on the extension matrix approach. By dividing the positive examples (PE) in a given example set into intersecting groups and adopting a set of strategies to find a heuristic conjunctive formula in each group which covers all the positive examples in the group and none of the negative examples (NE), it can find a covering formula in form [sic] of variable- value logic for PE against NE in low-order polynomial time. This paper presents the algorithm in detail and provides a comparison of it with ID3, a representative of the decision tree method based family of inductive algorithms." Bionics and artificial intelligence sigle Induction (Logic) Department of Artificial Intelligence: DAI research paper University <Edinburgh> 578 (DE-604)BV010450646 578 |
| spellingShingle | Wu, Xingdong HCV, a heuristic covering algorithm for extension matrix approach Bionics and artificial intelligence sigle Induction (Logic) |
| title | HCV, a heuristic covering algorithm for extension matrix approach |
| title_auth | HCV, a heuristic covering algorithm for extension matrix approach |
| title_exact_search | HCV, a heuristic covering algorithm for extension matrix approach |
| title_full | HCV, a heuristic covering algorithm for extension matrix approach |
| title_fullStr | HCV, a heuristic covering algorithm for extension matrix approach |
| title_full_unstemmed | HCV, a heuristic covering algorithm for extension matrix approach |
| title_short | HCV, a heuristic covering algorithm for extension matrix approach |
| title_sort | hcv a heuristic covering algorithm for extension matrix approach |
| topic | Bionics and artificial intelligence sigle Induction (Logic) |
| topic_facet | Bionics and artificial intelligence Induction (Logic) |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT wuxingdong hcvaheuristiccoveringalgorithmforextensionmatrixapproach |