{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-5144"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-5144","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"Hybrid Recommender Systems via Spectral Learning and a Random Forest","abstract":"We demonstrate spectral learning can be combined with a random forest classifier to produce a hybrid recommender system capable of incorporating meta information. Spectral learning is supervised learning in which data is in the form of one or more networks. Responses are predicted from features obtained from the eigenvector decomposition of matrix representations of the networks. Spectral learning is based on the highest weight eigenvectors of natural Markov chain representations. A random forest is an ensemble technique for supervised learning whose internal predictive model can be interpreted as a nearest neighbor network. A hybrid recommender can be constructed by first deriving a network model from a recommender's similarity matrix then applying spectral learning techniques to produce a new network model. The response learned by the new version of the recommender can be meta information. This leads to a system capable of incorporating meta data into recommendations.","abstract_html":"We demonstrate spectral learning can be combined with a random forest classifier to produce a hybrid recommender system capable of incorporating meta information. Spectral learning is supervised learning in which data is in the form of one or more networks. Responses are predicted from features obtained from the eigenvector decomposition of matrix representations of the networks. Spectral learning is based on the highest weight eigenvectors of natural Markov chain representations. A random forest is an ensemble technique for supervised learning whose internal predictive model can be interpreted as a nearest neighbor network. A hybrid recommender can be constructed by first deriving a network model from a recommender&#x27;s similarity matrix then applying spectral learning techniques to produce a new network model. The response learned by the new version of the recommender can be meta information. This leads to a system capable of incorporating meta data into recommendations.","abstract_has_math":false,"creators":["Williams, Alyssa"],"institution":"East Tennessee State University","degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019-12-01T08:00:00Z","date_published":"2019-12-01T08:00:00Z","updated_at":"2026-11-19T07:56:04Z","subjects":["similarity learning","collaborative filtering","nearest neighbors","Databases and Information Systems","Other Mathematics","Theory and Algorithms"],"languages":["eng"],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/3666","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/3666","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/5144/viewcontent/WilliamsA120219f.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dc.etsu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adc.etsu.edu%3Aetd-5144","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Williams, Alyssa"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2019-11-11T08:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2019-12-01T08:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["East Tennessee State University"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["East Tennessee State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["similarity learning","collaborative filtering","nearest neighbors","Databases and Information Systems","Other Mathematics","Theory and Algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/5144/viewcontent/WilliamsA120219f.pdf","https://dc.etsu.edu/etd/3666"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We demonstrate spectral learning can be combined with a random forest classifier to produce a hybrid recommender system capable of incorporating meta information. Spectral learning is supervised learning in which data is in the form of one or more networks. Responses are predicted from features obtained from the eigenvector decomposition of matrix representations of the networks. Spectral learning is based on the highest weight eigenvectors of natural Markov chain representations. A random forest is an ensemble technique for supervised learning whose internal predictive model can be interpreted as a nearest neighbor network. A hybrid recommender can be constructed by first deriving a network model from a recommender's similarity matrix then applying spectral learning techniques to produce a new network model. The response learned by the new version of the recommender can be meta information. This leads to a system capable of incorporating meta data into recommendations."]},{"key":"dc:title","label":"Title","values":["Hybrid Recommender Systems via Spectral Learning and a Random Forest"]}]}],"canonical_facts":{"dc:creator":["Williams, Alyssa"],"dc:date.available":["2019-11-11T08:00:00Z"],"dc:date.issued":["2019-12-01T08:00:00Z"],"dc:description.abstract":["We demonstrate spectral learning can be combined with a random forest classifier to produce a hybrid recommender system capable of incorporating meta information. Spectral learning is supervised learning in which data is in the form of one or more networks. Responses are predicted from features obtained from the eigenvector decomposition of matrix representations of the networks. Spectral learning is based on the highest weight eigenvectors of natural Markov chain representations. A random forest is an ensemble technique for supervised learning whose internal predictive model can be interpreted as a nearest neighbor network. A hybrid recommender can be constructed by first deriving a network model from a recommender's similarity matrix then applying spectral learning techniques to produce a new network model. The response learned by the new version of the recommender can be meta information. This leads to a system capable of incorporating meta data into recommendations."],"dc:identifier":["https://dc.etsu.edu/context/etd/article/5144/viewcontent/WilliamsA120219f.pdf","https://dc.etsu.edu/etd/3666"],"dc:language":["eng"],"dc:publisher":["East Tennessee State University"],"dc:rights":["Copyright by the authors."],"dc:subject":["similarity learning","collaborative filtering","nearest neighbors","Databases and Information Systems","Other Mathematics","Theory and Algorithms"],"dc:title":["Hybrid Recommender Systems via Spectral Learning and a Random Forest"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"],"thesis:institution_name":["East Tennessee State University"]},"updated_at":"2026-11-19T07:56:04Z"}