会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Classifying functions of web blocks based on linguistic features
    • 基于语言特征分类网页功能
    • US07895148B2
    • 2011-02-22
    • US11742283
    • 2007-04-30
    • Wei-Ying MaXiangye XiaoXing Xie
    • Wei-Ying MaXiangye XiaoXing Xie
    • G06N5/00
    • G06Q10/10
    • A classification system trains a classifier to classify blocks of the web page into various classifications of the function of the block. The classification system trains a classifier using training web pages. To train a classifier, the classification system identifies the blocks of the training web pages, generates feature vectors for the blocks that include a linguistic feature, and inputs classification labels for each block. The classification system learns the coefficients of the classifier using any of a variety of machine learning techniques. The classification system can then use the classifier to classify blocks of web pages.
    • 分类系统训练分类器将网页的块分类为块的功能的各种分类。 分类系统使用训练网页训练分类器。 为了训练分类器,分类系统识别训练网页的块,为包括语言特征的块生成特征向量,并为每个块输入分类标签。 分类系统使用各种机器学习技术中的任何一种学习分类器的系数。 然后,分类系统可以使用分类器对网页块进行分类。
    • 2. 发明申请
    • DENSITY-BASED CO-LOCATION PATTERN DISCOVERY
    • 基于密度的同位素模式发现
    • US20090327342A1
    • 2009-12-31
    • US12145695
    • 2008-06-25
    • Xiangye XiaoXing XieWei-Ying Ma
    • Xiangye XiaoXing XieWei-Ying Ma
    • G06F17/30
    • G06F17/30241
    • Described is using density to efficiently mine co-location patterns, such as closely located businesses frequently found together in business listing databases, geographic search logs, and/or GPS-based data. A data space of such information is geographically partitioned into a grid of cells, with dense cells scanned first. A dynamic upper bound of prevalence measure of co-location patterns is maintained during the scanning process. If the current upper bound is smaller than a threshold, the scanning is stopped, thereby significantly reducing the computation cost for processing many cells, while providing suitable results.
    • 描述的是使用密度来有效地挖掘共同位置模式,例如在商业列表数据库,地理搜索日志和/或基于GPS的数据中经常发现的紧密定位的商业。 这种信息的数据空间在地理上被划分成一个单元格格,密集单元首先被扫描。 在扫描过程中保持了同位置模式的流行度测量的动态上限。 如果当前上限小于阈值,则停止扫描,从而显着降低了处理许多小区的计算成本,同时提供了合适的结果。
    • 4. 发明授权
    • Density-based co-location pattern discovery
    • 基于密度的协同定位模式发现
    • US08326834B2
    • 2012-12-04
    • US12145695
    • 2008-06-25
    • Xiangye XiaoXing XieWei-Ying Ma
    • Xiangye XiaoXing XieWei-Ying Ma
    • G06F17/30
    • G06F17/30241
    • Described is using density to efficiently mine co-location patterns, such as closely located businesses frequently found together in business listing databases, geographic search logs, and/or GPS-based data. A data space of such information is geographically partitioned into a grid of cells, with dense cells scanned first. A dynamic upper bound of prevalence measure of co-location patterns is maintained during the scanning process. If the current upper bound is smaller than a threshold, the scanning is stopped, thereby significantly reducing the computation cost for processing many cells, while providing suitable results.
    • 描述的是使用密度来有效地挖掘共同位置模式,例如在商业列表数据库,地理搜索日志和/或基于GPS的数据中一起经常找到的紧密定位的商业。 这种信息的数据空间在地理上被划分成一个单元格格,密集单元首先被扫描。 在扫描过程中保持了同位置模式的流行度测量的动态上限。 如果当前上限小于阈值,则停止扫描,从而显着降低了处理许多小区的计算成本,同时提供了合适的结果。
    • 5. 发明授权
    • Indexing large-scale GPS tracks
    • 索引大型GPS轨道
    • US08078394B2
    • 2011-12-13
    • US12037263
    • 2008-02-26
    • Longhao WangYu ZhengXing XieWei-Ying Ma
    • Longhao WangYu ZhengXing XieWei-Ying Ma
    • G06F17/00
    • G06F17/30551G06F17/30241G06F17/30327G06F17/30333
    • Described is a technology by which uploaded GPS data is indexed according to spatio-temporal relationships to facilitate efficient insertion and retrieval. The indexes may be converted to significantly smaller-sized data structures when new updates to that structure are not likely. GPS data is processed into a track of spatially-partitioned segments such that each segment has a cell. Each cell has an associated temporal index (a compressed start-end tree), into which data for that cell's segments are inserted. The temporal index may include an end time index that relates each segment's end time to a matching start time index. Given query input comprising a spatial predicate and a temporal predicate, tracks may be searched for by determining which spatial candidate cells may contain matching results. For each candidate cell, the search accesses the cell's associated temporal index to find any track or tracks that correspond to the temporal predicate.
    • 描述了一种根据时空关系对上传的GPS数据进行索引的技术,以便于有效的插入和检索。 当该结构的新更新不太可能时,索引可能会转换为显着更小的数据结构。 GPS数据被处理成空间分割的段的轨道,使得每个段具有一个单元。 每个单元都具有关联的时间索引(压缩的开始结束树),该单元格的段的数据被插入到该时间索引中。 时间索引可以包括将每个段的结束时间与匹配的开始时间索引相关联的结束时间索引。 给定包括空间谓词和时间谓词的查询输入,可以通过确定哪些空间候选小区可以包含匹配结果来搜索轨道。 对于每个候选小区,搜索访问小区的相关联的时间索引以找到与时间谓词相对应的任何轨道或​​轨道。
    • 10. 发明申请
    • INDEXING LARGE-SCALE GPS TRACKS
    • 引导大规模GPS跟踪
    • US20090216787A1
    • 2009-08-27
    • US12037263
    • 2008-02-26
    • Longhao WangYu ZhengXing XieWei-Ying Ma
    • Longhao WangYu ZhengXing XieWei-Ying Ma
    • G06F7/00G06F17/30
    • G06F17/30551G06F17/30241G06F17/30327G06F17/30333
    • Described is a technology by which uploaded GPS data is indexed according to spatio-temporal relationships to facilitate efficient insertion and retrieval. The indexes may be converted to significantly smaller-sized data structures when new updates to that structure are not likely. GPS data is processed into a track of spatially-partitioned segments such that each segment has a cell. Each cell has an associated temporal index (a compressed start-end tree), into which data for that cell's segments are inserted. The temporal index may include an end time index that relates each segment's end time to a matching start time index. Given query input comprising a spatial predicate and a temporal predicate, tracks may be searched for by determining which spatial candidate cells may contain matching results. For each candidate cell, the search accesses the cell's associated temporal index to find any track or tracks that correspond to the temporal predicate.
    • 描述了一种根据时空关系对上传的GPS数据进行索引的技术,以便于有效的插入和检索。 当该结构的新更新不太可能时,索引可能会转换为显着更小的数据结构。 GPS数据被处理成空间分割的段的轨道,使得每个段具有一个单元。 每个单元都具有关联的时间索引(压缩的开始结束树),该单元格的段的数据被插入到该时间索引中。 时间索引可以包括将每个段的结束时间与匹配的开始时间索引相关联的结束时间索引。 给定包括空间谓词和时间谓词的查询输入,可以通过确定哪些空间候选小区可以包含匹配结果来搜索轨道。 对于每个候选小区,搜索访问小区的相关联的时间索引以找到与时间谓词相对应的任何轨道或​​轨道。