subset

问题 If I want to select a subset of data in R, I can use the subset function. I wanted to base an analysis on data that that was matching one of a few criteria, e.g. that a certain variable was either 1, 2 or 3. I tried myNewDataFrame <- subset(bigfive, subset = (bigfive$bf11==(1||2||3))) It did always just select values that matched the first of the criteria, here 1. My assumption was that it would start with 1 and if it does evaluate to "false" it would go on to 2 and than to 3, and if none

问题 I've been encountering what I think is a bug. It's not a big deal, but I'm curious if anyone else has seen this. Unfortunately, my data is confidential, so I have to make up an example, and it's not going to be very helpful. When subsetting my data, I occassionally get mysterious NA rows that aren't in my original data frame. Even the rownames are NA. EG: example <- data.frame("var1"=c("A", "B", "A"), "var2"=c("X", "Y", "Z")) example var1 var2 1 A X 2 B Y 3 A Z then I run: example[example

问题 I want to find the subsets of a set of integers. It is the first step of "Sum of Subsets" algorithm with backtracking. I have written the following code, but it doesn't return the correct answer: BTSum(0, nums); ///************** ArrayList<Integer> list = new ArrayList<Integer>(); public static ArrayList<Integer> BTSum(int n, ArrayList<Integer> numbers) { if (n == numbers.size()) { for (Integer integer : list) { System.out.print(integer+", "); } System.out.println("********************");

问题 I need an algorithm to find all of the subsets of a set where the number of elements in a set is n . S={1,2,3,4...n} Edit: I am having trouble understanding the answers provided so far. I would like to have step-by-step explanation of how the answers work to find the subsets. For example, S={1,2,3,4,5} How do you know {1} and {1,2} are subsets? Could someone help me with a simple function in c++ to find subsets of {1,2,3,4,5} 回答1: It's very simple to do this recursively. The basic idea is

问题 I'm trying to find an algorithm to find K disjoint, contiguous subsets of size L of an array x of real numbers that maximize the sum of the elements. Spelling out the details, X is a set of N positive real numbers: X={x[1],x[2],...x[N]} where x[j]>=0 for all j=1,...,N. A contiguous subset of length L called S[i] is defined as L consecutive members of X starting at position n[i] and ending at position n[i]+L-1 : S[i] = {x[j] | j=n[i],n[i]+1,...,n[i]+L-1} = {x[n[i]],x[n[i]+1],...,x[n[i]+L-1]}.

问题 I was asked to do the coding project for a job as an intern in a company but I wasnt able to complete it. However I didn't get the job I wanted to just complete the thing . The error that arrives is: Error :Result must have length 12813, not 0 Here is my code: library(shiny) library(dplyr) stock<-read.csv("thafinal2.0.csv") ui <- fluidPage( dateInput(inputId = 'date1',label = 'Start',value = "2017-08-20"), dateInput(inputId = 'date2',label = 'Stop',value = "2018-08-20"), tabPanel("stock", DT:

问题 This question already has answers here : Filtering a data frame by values in a column [duplicate] (3 answers) Closed 8 months ago . I have the following data with the ID of subjects. V1 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 4 17 4 18 4 19 4 20 4 21 4 22 4 23 4 24 4 I want to subset all the rows of the data where V1 == 4. This way I can see which observations relate to subject 4. For example, the correct output would be 16 4 17 4 18 4 19 4 20 4 21 4 22 4 23 4 24

问题 I am trying to keep all my rows in the dataframe but DROP the form 2 rows that do not fall with a minimum of 2 years of form 8. library(tidyverse) forms <- data_frame( CASEID = rep(01012,5), VISIT = c(450, 450, 365, 365, 450), FORM = c(18, 8, 7, 2, 2), DTYvisit = c(2006, 2006, 2003, 2003, 2006) ) > forms # A tibble: 5 x 4 CASEID VISIT FORM YEAR <dbl> <dbl> <dbl> <dbl> 1 1012 450 18 2006 2 1012 450 8 2006 3 1012 365 7 2003 4 1012 365 2 2003 5 1012 450 2 2004 6 1013 450 8 2003 7 1013 450 18

问题 I'm trying to write an algorithm to solve a subset sum problem. I believe I have the start of the algorithm however I want to write something that will start off with 1 set to N sets depending on the length of the array. Ideally it will end up spitting out the first result that matches. I believe that this could be written way better since it does follow a pattern. Any input is appreciated. Thanks! Antonio Function SubnetSum() Dim num() As Variant Dim goal As Double Dim result As Double Num()

问题 I am using ddply to execute glm on subsets of my data. I am having difficulty accessing the estimated Y values. I am able to get the model parameter estimates using the below code, but all the variations I've tried to get the fitted values have fallen short. The dependent and independent variables in the glm model are column vectors, as is the "Dmsa" variable used in the ddply operation. Define the model: Model <- function(df){coef(glm(Y~D+O+B+A+log(M), family=poisson(link="log"), data=df))}