会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Data mining technique with federated evolutionary coordination
    • 数据挖掘技术与联合进化协调
    • US09466023B1
    • 2016-10-11
    • US14011062
    • 2013-08-27
    • SENTIENT TECHNOLOGIES (BARBADOS) LIMITED
    • Hormoz ShahrzadBabak Hodjat
    • G06N3/08
    • G06N3/086G06F9/5066G06F2209/5017G06N3/126G06Q10/0633
    • Roughly described, a data mining arrangement for developing high quality classifiers using an evolutionary algorithm, includes a plurality of “mid-chain” evolutionary coordinators, down-chain of a main (top-chain) evolutionary coordinator and up-chain of evolutionary engines. Multiple levels of mid-chain evolutionary coordinators can be used in a hierarchy, and the various branches of the hierarchy need not have equal length. Each evolutionary coordinator (other than the top-chain evolutionary coordinator) appears to its up-chain neighbor as if it were an evolutionary engine, though it does not actually perform any evolution itself. Similarly, each evolutionary coordinator (including the top-chain evolutionary coordinator) also appears to its down-chain neighbors as a top-chain evolutionary coordinator. Each mid-chain evolutionary coordinator maintains its own local candidate pool, reducing the load on the top-chain evolutionary coordinator pool, as well as reducing bandwidth requirements. Only the evolutionary engines perform actual testing of candidate individuals on training data.
    • 粗略地描述,使用进化算法开发高质量分类器的数据挖掘安排包括多个“中链”进化协调器,下游链(主链)进化协调器和进化引擎的上链。 可以在层次结构中使用多级中级进化协调器,并且层次结构的各种分支不需要具有相等的长度。 每个进化协调器(除了顶级进化协调器之外)似乎都是其上链邻居,就像它是一个进化引擎一样,尽管它实际上并不执行任何进化本身。 同样,每个进化协调员(包括顶级进化协调员)在其下游邻居中似乎也是顶级进化协调员。 每个中链进化协调器维护自己的本地候选池,减少顶级进化协调器池的负载,并减少带宽需求。 只有进化引擎对候选人进行培训数据的实际测试。
    • 6. 发明授权
    • Evolutionary technique with n-pool evolution
    • 具有n池进化的进化技术
    • US09304895B1
    • 2016-04-05
    • US13945630
    • 2013-07-18
    • SENTIENT TECHNOLOGIES (BARBADOS) LIMITED
    • Hormoz ShahrzadKaivan KamaliBabak HodjatDaniel Edward Fink
    • G06F11/36G06F17/30
    • G06F11/3692G06F11/3668G06F17/30477G06F17/30572
    • Roughly described, a training database contains N segments of data samples. Candidate individuals identify a testing experience level, a fitness estimate, a rule set, and a testing set TSi of the data samples on which it is tested. The testing sets have fewer than all of the data segments and they are not all the same. Testing involves testing on only the individual's assigned set of data segments, updating the fitness estimates and testing experience levels, and discarding candidates through competition. If an individual reaches a predetermined maturity level of testing experience, then validating involves further testing it on samples of the testing data from a testing data segment other than those in the individual's testing set TSi. Those individuals that satisfy validation criteria are considered for deployment.
    • 粗略描述,训练数据库包含N个数据样本段。 候选人确定测试经验水平,适应度估计,规则集和测试集合的测试集TSi。 测试集比所有数据段少,并不完全相同。 测试包括仅对个人分配的数据段进行测试,更新健身评估和测试体验水平,并通过竞争来抛弃候选人。 如果个人达到预定的成熟度水平的测试经验,则验证将进一步测试来自测试数据的测试数据样本,而不是个体测试集TSi中的测试数据段。 满足验证标准的那些人员被考虑部署。