会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • Efficient Data Layout Techniques for Fast Machine Learning-Based Document Ranking
    • 基于快速机器学习的文档排序的高效数据布局技术
    • US20100070457A1
    • 2010-03-18
    • US12211636
    • 2008-09-16
    • Arun KejariwalGirish VaitheeswaranSapan Panigrahi
    • Arun KejariwalGirish VaitheeswaranSapan Panigrahi
    • G06N5/02
    • G06N99/005
    • A computer readable medium stores a program for optimization for a search, and has sets of instructions for receiving a first decision tree. The first decision tree includes several nodes, and each node is for comparing a feature value to a threshold value. The instructions are for weighting the nodes within the first decision tree, determining the weighted frequency of a first feature within the first decision tree, and determining the weighted frequency of a second feature within the first decision tree. The instructions order the features based on the determined weighted frequencies, and store the ordering such that values of features having higher weighted frequencies are retrieved more often than values of features having lower weighted frequencies within the first decision tree.
    • 计算机可读介质存储用于搜索的优化的程序,并且具有用于接收第一决策树的指令集。 第一决策树包括几个节点,每个节点用于将特征值与​​阈值进行比较。 所述指令用于对第一决策树内的节点进行加权,确定第一决策树内的第一特征的加权频率,以及确定第一决策树内的第二特征的加权频率。 指令基于确定的加权频率对特征进行排序,并存储排序,使得具有较高加权频率的特征值比第一决策树中具有较低加权频率的特征的值更频繁地检索。
    • 5. 发明授权
    • Efficient data layout techniques for fast machine learning-based document ranking
    • 高效的数据布局技术,用于快速的基于机器学习的文档排序
    • US08533129B2
    • 2013-09-10
    • US12211636
    • 2008-09-16
    • Arun KejariwalGirish VaitheeswaranSapan Panigrahi
    • Arun KejariwalGirish VaitheeswaranSapan Panigrahi
    • G06F15/18
    • G06N99/005
    • A computer readable medium stores a program for optimization for a search, and has sets of instructions for receiving a first decision tree. The first decision tree includes several nodes, and each node is for comparing a feature value to a threshold value. The instructions are for weighting the nodes within the first decision tree, determining the weighted frequency of a first feature within the first decision tree, and determining the weighted frequency of a second feature within the first decision tree. The instructions order the features based on the determined weighted frequencies, and store the ordering such that values of features having higher weighted frequencies are retrieved more often than values of features having lower weighted frequencies within the first decision tree.
    • 计算机可读介质存储用于搜索的优化的程序,并且具有用于接收第一决策树的指令集。 第一决策树包括几个节点,每个节点用于将特征值与​​阈值进行比较。 所述指令用于对第一决策树内的节点进行加权,确定第一决策树内的第一特征的加权频率,以及确定第一决策树内的第二特征的加权频率。 指令基于确定的加权频率对特征进行排序,并存储排序,使得具有较高加权频率的特征值比第一决策树中具有较低加权频率的特征的值更频繁地检索。