Titlebook: Case-Based Reasoning Research and Development; 7th International Co Rosina O. Weber,Michael M. Richter Conference proceedings 2007 Springer

Julienne

書目名稱Case-Based Reasoning Research and Development影響因子(影響力)




書目名稱Case-Based Reasoning Research and Development影響因子(影響力)學(xué)科排名




書目名稱Case-Based Reasoning Research and Development網(wǎng)絡(luò)公開度




書目名稱Case-Based Reasoning Research and Development網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Case-Based Reasoning Research and Development被引頻次




書目名稱Case-Based Reasoning Research and Development被引頻次學(xué)科排名




書目名稱Case-Based Reasoning Research and Development年度引用




書目名稱Case-Based Reasoning Research and Development年度引用學(xué)科排名




書目名稱Case-Based Reasoning Research and Development讀者反饋




書目名稱Case-Based Reasoning Research and Development讀者反饋學(xué)科排名

有效

A Case-Based Framework for Collaborative Semantic Search in Knowledge Siftery-driven search system based on Web services. The Knowledge Sifter architecture is extended to include a case-based methodology for collaborative semantic search, including case creation, indexing and retrieval services. A collaborative filtering methodology is presented that uses stored cases as a

Androgen

Detain

Acquiring Word Similarities with Higher Order Association Miningones for estimating their similarity. If word . co-occurs with word ., we say . and . share a first order association between them. If . co-occurs with . in some documents, and . with . in some others, then . and . are said to share a second order co-occurrence via .. Higher orders of co-occurrence

上下連貫

GRE

When Similar Problems Don’t Have Similar Solutionsstruct the case base invariably contains erroneous, noisy cases. Automated removal of these noisy cases can improve system accuracy. In addition, error rates for nearest neighbour classifiers can often be reduced by removing cases to give smoother decision boundaries between classes. In this paper w

GRE

anticipate

售穴

Using Cases Utility for Heuristic Planning Improvementarch tree becomes a key issue, in order to select efficiently nodes to evaluate from the successors of the current search node. In a previous work, we successfully applied a CBR approach to order nodes for evaluation, thus reducing the number of calls to the heuristic function. However, once cases w

脾氣暴躁的人