SQL Server 的 Google B 树实现有大量信息，但实际的实现可能在很大程度上取决于您的决策树实现。
祝你好运！
What you are trying to do is definitely not trivial. As for the decision making algorithm have you looked into C4.5 ? I was unable to find a implementation in C# for it so you may be on your own. ID3 may also work for you.
Google b-tree implementations for SQL Server there is tons of information out there, but the actual implementation may depend heavily on your decision tree implementation.
As it's been mentioned, decision tree generating algorithms are what you'll want to use. However, since your system will want to incrementally "update" itself after each "session" with the user, you may want to use an incremental decision tree algorithm, so you don't have to run a long batch update each time.
发布评论
评论（2）
你想做的事情绝对不是微不足道的。至于决策算法，您是否研究过 C4.5 ？我无法找到它的 C# 实现，因此您可能需要自己解决。 ID3 也可能适合您。
SQL Server 的 Google B 树实现有大量信息，但实际的实现可能在很大程度上取决于您的决策树实现。
祝你好运！
What you are trying to do is definitely not trivial. As for the decision making algorithm have you looked into C4.5 ? I was unable to find a implementation in C# for it so you may be on your own. ID3 may also work for you.
Google b-tree implementations for SQL Server there is tons of information out there, but the actual implementation may depend heavily on your decision tree implementation.
Good Luck!
正如前面提到的，您将需要使用决策树生成算法。但是，由于您的系统希望在与用户的每次“会话”之后逐步“更新”自身，因此您可能需要使用 增量决策树算法，因此您不必每次都运行长时间的批量更新。
As it's been mentioned, decision tree generating algorithms are what you'll want to use. However, since your system will want to incrementally "update" itself after each "session" with the user, you may want to use an incremental decision tree algorithm, so you don't have to run a long batch update each time.